Visual device, interlocking counter, and image sensor

ABSTRACT

A visual device including plurality of array operation units or plurality of virtual array operation units arranged in a shape of a two-dimensional lattice, wherein each of all of the array operation units and all of the virtual array operation units includes a processor, a set of memories and plurality of controllers, wherein at least one controller transmits a calculation datum only at most a number of times related to a number of the controller, to which the processor wrote the calculation data, by that a number is assigned to at least two controllers at intervals of an appointed number, and each of all of the controllers based on a number shifting arrangement.

CROSS REFERENCE TO RELATED APPLICATION

This is a continuation of U.S. application Ser. No. 10/471,555, filedSep. 12, 2003. This application relates to and claims priority fromJapanese Patent Application No. 2001/69886, filed Mar. 13, 2001, No.2001/134921, filed May 2, 2001, No. 2001/160172, filed May 29, 2001, No.2001/176755, filed Jun. 12, 2001, No. 2001/229174, filed Jul. 30, 2001,No. 2001/321614, filed Oct. 19, 2001 and No. 2001/388967, filed Dec. 21,2001. The entirety of the contents and subject matter of all of theabove is incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to a visual device searching andrecognizing an object, whose array operation units and virtual arrayoperation units carry out local and parallel image processing like ageometrical analysis means and so on, wherein an image sensor comprisesa data processing device which consists of these array operation unitsand virtual array operation units, an interlocked device which drivesthese array operation units and virtual array operation units, andsensor modules.

BACKGROUND OF THE INVENTION

In the present invention, a visual device has been developed as a devicecontrolling a moving camera and carrying out image processing (forexample, refer to Published Unexamined Japanese Patent Application No.2001-43385, Published Unexamined Japanese Patent Application No.2001-101403, Published Unexamined Japanese Patent Application No.2001-148006, Published Unexamined Japanese Patent Application No.2001-148022, Published Unexamined Japanese Patent Application No.2001-148024 and PCT Publication Number WO 00/16259). The visual devicesearches an object and carries out image processing of the object, bycontrolling a mechanism of pan, tilt and zoom. Image processing whichthe visual device carries out is mostly local processing, and the localprocessing can be carried out in parallel by array operation unitsarranged in the shape of a lattice. The visual device, however, hasmainly four problems. First, a figure/ground separation means needs hugecomputational complexity, in order for nonlinear oscillators to separateat least one object area and a background area. Second, a patternmatching means needs many template images, in order to recognizecorrectly a normalized image, in which colors and patterns of the objectare mixed. Third, a geometrical analysis means must carry out globalprocessing like Fourier transform, Affine transform and Hough transform,in order to detect rough form of the object in an image. Fourth, an areanormalization means needs a processor comprising a divider for carryingout division by a natural number, or a look-up table for memorizing areciprocal number of the natural number, in order to complement betweenpixels of a normalized image. Therefore, these means heavily hinderedfrom manufacturing of a high-performance image sensor comprising thevisual device.

First, in a past figure/ground separation means, each nonlinearoscillator used a random number as an external noise, or formed edgeinformation constructing a pixel of a formed edge-information imageinputted. Thus, there is no correlation between the nonlinear oscillatorwithin an object area or a background area segmented by the formededge-information image and the external noise. As a result, eachnonlinear oscillator can not shift its phase from phases of nonlinearoscillators at its neighbors until the phases of these nonlinearoscillators reach suitable combination. This is a factor thatcomputational complexity of the figure/ground separation meansincreases. By using a position/size detection means, however, the visualdevice can generate a redundant-information image representing anapproximate position of a center of gravity and size of an object areasegmented by the formed edge-information image. Since each nonlinearoscillator inputs redundant information constructing a correspondingpixel in the redundant-information image as the random number, eachnonlinear oscillator within the object area shifts its phase in order,from the approximate position of a center of gravity toward itscircumference.

Considering these facts, a figure/ground separation means comes toseparate an object area and a background area more quickly than the pastone because a position/size detection means detects an approximateposition of a center of gravity and size of the object area segmented bya formed edge-information image.

Next, in a past visual device, a pattern matching means needs a greatnumber of template images, in order to carry out pattern matching of anormalized image, in which a segmented object area in a digital imagecorresponding to an object area is normalized. The reason is that thenormalized image is generally a multi-band image with noise, and alsothat the pattern matching means compared the normalized image with manytemplate images, without distinguishing colors and patterns of an objectrepresented by the normalized image. In short, at least the same numberof the template images as the number of combinations of the colors andthe patterns of the object are desired. Consider here two cases ofcarrying out pattern matching of the colors and the patterns of theobject represented by the normalized image, respectively. Suppose firstthat a color of the object is a color represented by the most of pixelsin the normalized image. The pattern matching means can detect the colorof the object represented by the normalized image, by preparing only thesame number of template images as the number of colors to detect, wherethe template images are filled by a color different from each other,among the colors to detect. In addition, even though position and sizeof the object in the digital image are changed, the pattern matchingmeans can detect a color of the object, by comparing a color of eachpixel within the segmented object area with colors of the templateimages. Therefore, it is not necessary for the segmented object area tobe normalized. On the other hand, as concern the pattern of the object,suppose that an edge-information formation means once generates a formededge-information image from the segmented object area, instead of thenormalized image corresponding to the segmented object area, followed bythat a geometrical analysis means uses the normalized imagecorresponding to an image generated from the formed edge-informationimage. Since at least one pixel in the normalized image denotes form andsize representing a part of pattern of an object at its circumference,the pattern matching means can easily select the most similar templateimage with the normalized image, in spite of position and size of anobject area.

Considering these facts, plurality of pattern matching means for colorsand patterns come to reduce the number of template images very much,respectively, because a visual device individually processes a color anda pattern of an object represented by an object area, using plurality ofthe pattern matching means.

Next, when the number of template images increased, a past geometricalanalysis means used a suitable combination of extracting only contourfrom edge information of an object in an animation image by usingFourier transform, normalizing size of the contour of the object in theanimation image by using Affine transform, and specifying form of theobject in the animation image by using Hough transform. However, sincethese transform methods not only process an image exactly but also carryout global processing, implementation of a visual device by hardware isnot suitable. Pay attention here that the geometrical analysis meansdetects approximate form of the object. If the geometrical analysismeans can derive position and inclination from some parts of the contourof the object hashed, and if it can collect the inclination at thecenter of gravity of the contour of the object, the geometrical analysismeans can detect the approximate form of the object.

Considering these facts, a geometrical analysis means comes to detectposition and form of an object suitable for image processing, because ameans for detecting inclination calculates length and inclination angleof some line segments representing contour of the object from a formededge-information image, followed by calculation distance of transfer ofthe line segments during moving the length and the inclination angle ofthe line segments toward the direction of the center of gravity of thecontour of the object every inclination angle. In addition, a contourline of the object has been already divided into some independent linesegments. Therefore, if pixels in the line segments are movedindependently, satisfying with an appointed limitation condition betweenthem and their neighbors, the geometrical analysis means comes to detectthe position and the form of the object, with a little of hardwarecomplexity and computational complexity.

Finally, after an area normalization means once moved each pixel withina segmented object area in a digital image corresponding to an objectarea to a whole of the digital image as distance of the pixels isapproximated equal each other, the area normalization means generates anormalized image whose size is equal to size of the digital image, bycomplementing pixels between these pixels with an average of pixels attheir neighbors. In order to complement between the pixels, therefore,the area normalization means must carry out division by a natural numberor multiplication by a reciprocal number of the natural number. Thereasons why the area normalization means complements in such a way areas follows: First reason is that, in a case that some segmented objectareas whose size and position are different from each other denote thesame object, a pattern matching means which is a destination of thenormalized image must have many template images of the same object if apattern of the segmented object area is not restructured with each pixelof the segmented object area which was once resolved. Second reason isthat the similarity between the normalized image and a template imagerepresenting the same kind of object as one in the normalized imageincreases, by complementing between the pixels of the segmented objectarea which was once resolved because the digital image is generally amulti-band image with noise. As the above, however, in a case that anedge-information formation means once generates a formededge-information image from the segmented object area, instead of thenormalized image corresponding to the segmented object area, followed bythat the pattern matching means uses a normalized image corresponding toan image generated by a geometrical analysis means from the formededge-information image, at least one pixel in the normalized imagedenotes form and size representing a part of pattern of the object atits circumference. Therefore, even though the area normalization meansdoes not complement, the pattern matching means can select the mostsimilar template image with the normalized image, among some templateimages.

Considering these facts, a pattern matching means comes to select apattern of an object represented by an object area even though an areanormalization means does not complement.

Now, this visual device searches an object and carries out imageprocessing of the object, by controlling a mechanism of pan, tilt andzoom in a moving camera. Image processing carried out by the visualdevice is mostly local processing, and the local processing can becarried out in parallel by array operation units arranged in the shapeof a two-dimensional lattice. In a case that the array operation unitsare implemented on an LSI, each array operation unit is designed as itcan communicate with its adjoining array operation units asynchronously,by using signals named SEND and RECEIVE. Therefore, since a wiringpattern becomes extremely simple, and wire length becomes short, the LSIcan reduce its power consumption, increasing an implementation surfaceof transistors. In addition, all of the array operation units do notalways have to synchronize with each other.

By the way, there are four problems on a past array operation unit.First, in a controller which sent a SEND, a time from sending a SEND toreceiving a RECEIVE became long. This cause is that a controller whichreceived the SEND does not reply the RECEIVE until it inputs acalculation datum, type, transmission times in a horizontal directionand transmission times in a vertical direction. In the past arrayoperation unit, therefore, a processor must wait until upper, lower,left and right RECEIVE STATUS signals in the controller which sent theSEND are updated certainly. In this way, however, even though thecontroller communicates asynchronously, the processor must waste time invain. Second, it is difficult to distinguish a calculation datum beforetransmitting and a calculation datum after transmitting because order oftransmitting the calculation data is irregular. This cause is that allarray operation units work independently. In the past array operationunit, therefore, a memory stored a received calculation datum with aSEND FLAG to be transmitted, while the processor had updated the SENDFLAG related with a calculation datum transmitted, after it transmittedthe calculation datum, always checking all of SEND FLAGs memorized inthe memory. In this way, however, the processor must check repeatedlythe SEND FLAG of the calculation datum which has been alreadytransmitted. Third, in a case that a calculation datum is transmittedtoward three directions simultaneously, a processor does not alwayssucceed in writing the calculation datum to its controller. This causesis that the controller can send a calculation datum at a time to onlyarray operation units at four neighbors. In the past array operationunit, therefore, the more the number of array operation units designatedby SEND FLAGs becomes, the longer time the processor must wait for untilit can write a next calculation datum to the controller. Fourth, in acase that a calculation datum is transmitted toward three directionssimultaneously, it is difficult for an array operation unit received thecalculation datum to distinguish two array operation units which aredesignated by transmission times in a horizontal direction andtransmission times in a vertical direction of the calculation datum,where the transmission times in each direction designating the arrayoperation units are equal to each other. This cause is that a controllercommunicates the transmission times in the horizontal direction and thetransmission times in the vertical direction, only by using anon-negative integer. In the past array operation unit, therefore, apriority was assigned to two array operation units which are senders ofcalculation data, and the array operation unit had always transmitted inorder, from a calculation datum of an array operation unit whosepriority is high. In this way, however, transmission efficiency is badbecause a calculation datum of an array operation unit whose priority islow has not been transmitted until the calculation datum of the arrayoperation unit whose priority is high is inputted. The most effectivemethod solving these problems is to design a high-performancecontroller. For example, in order to solve the first problem, frequencyof a clock signal of the controller has better become higher thanfrequency of a clock signal of the processor. In order to solve thesecond problem, the controller has better comprise an electronic circuitlike a FIFO (First In First Out). In order to solve the third problem,the controller has better be able to send some calculation data to thearray operation units at its four neighbors simultaneously. In order tosolve the fourth problem, the controller has better be added twocircuits representing one bit for the transmission times in thehorizontal direction and the transmission times in the verticaldirection, respectively. Suppose, however, that a designer tries todesign such an array operation circuit in practice, hardware complexityof the array operation unit becomes huge.

Thus, in order to solve the first problem, the controller has betterinput the calculation datum, the type, the transmission times in thehorizontal direction and the transmission times in the verticaldirection after it received the SEND, followed by memorizing the SENDand replying the RECEIVE immediately. In order to solve the secondproblem, a substitute for the FIFO has better be implemented in thememory and the processor. In order to solve the third and fourthproblems, the calculation datum have better be transmitted only in atmost two directions simultaneously.

Considering these facts, an array operation unit whose transmissionefficiency is high comes to be designed by implementing stacks andcyclic buffers in the memory and the processor, and by transmitting thecalculation datum counter-clockwisely and clockwisely.

Now, LSIs which are fast and have much transistors have been recentlydeveloped by rapid progress of LSI technology. As concerns the degree ofaccumulation of LSIs, not only technology detailing the design rule butalso three-dimensional LSI technology (e.g., refer to PublishedUnexamined Japanese Patent Application No. S63-174356, PublishedUnexamined Japanese Patent Application No. H2-35425, PublishedUnexamined Japanese Patent Application No. H7-135293), especiallytechnology for putting together some wafers (e.g., refer to Koyanagi,M., Kurino, H., Lee, K-W., Sakuma, K., Miyakawa, N., Itani, H., “FutureSystem-on-Silicon LSI Chips”, IEEE MICRO, Vol. 18, No. 4, pp. 17-22,1998) have been developed. Moreover, a lot of technologies stacking manychips (e.g., refer to Nikkei Microdevices, June 2000, pp. 62-79, NikkeiMicrodevices June 2000, pp. 157-164, Nikkei Microdevices June 2000, pp.176) have been recently developed. In short, since the LSIs have moreand more transistors, some digital circuits implemented in someseparated LSIs in past come to be implemented in an LSI easily. On theother hand, as concerns processing speed of the LSI, the more thefrequency of a clock signal becomes, the serious the problems on clockskew and propagation delay time of signals becomes.

In order to solve these problems, then, many PLLs (Phase Locked Loops)has been used in the LSI. Note that these PLLs input a reference signalwhose phase is fixed. In addition, comparing the difference between aphase of the reference signal and a phase of a comparison signalgenerated by each PLL, they change phases of their comparison signals asthe difference becomes zero radian. In a case that there are many PLLsin the LSI, however, it is impossible to coincide phases of all PLLsbecause of propagation delay time of the reference signal. In addition,two PLLs can not communicate their comparison signals with each other.The reason is that neither PLL can generate its comparison signal whosephase is fixed, because of propagation delay time of these comparisonsignals. That is, if the phase difference of the comparison signal ineither PLL becomes zero radian, the phase difference of the comparisonsignal in another PLL becomes twice of its propagation delay time.Therefore, both PLLs generate a big jitter of their comparison signals.Of course, a clock signal generated by the PLL generates a fatal jitter.

Let us aim here that each array operation unit can communicate with itsadjoining array operation units asynchronously. In this case, all arrayoperation units have better input not a clock signal whose phase isfixed but a clock signal whose period is fixed. Therefore, it is enoughfor a visual device to comprise such counters as all of their countnumbers coincide within an appointed time, where the counters compriseindependent oscillator circuits, respectively, and they communicatetheir count numbers with each other. In addition, suppose that eachcounter adjusts a phase of the oscillator circuit, according to thecount numbers of all adjoining counters. As a result, a time for whichall of the count numbers coincide becomes long.

Considering these facts, a counter comes to always coincide its countnumber with others and to supply a whole of an LSI with a high-frequencyclock signal if the counter has a mechanism for memorizing all signalsinputted from an external part individually, and if an oscillatorcircuit has a mechanism for synchronizing with a signal generated by thecounter.

Now, many image sensors have been developed, using CCD (Charge CoupledDevice) and CMOS (Complementary Metal Oxide Semiconductor) technology.Since many of these image sensors are used to generate a video signal,they are a row-parallel type of image sensors. In addition, some imagesensors stacking photo-receptor elements, charge amplifiers, A/Dconverters and digital circuits have been developed, usingthree-dimensional LSI (Large Scale Integrated Circuit) technology (e.g.,refer to Published Unexamined Japanese Patent Application No.S63-174356, Published Unexamined Japanese Patent Application No.H2-35425, Published Unexamined Japanese Patent Application No.H7-135293). Many of these image sensors are a pixel-parallel type ofimage sensors using some vertical signal lines effectively, where aphoto-receptor element, a charge amplifier, an A/D converter and adigital circuit are arranged vertically. Especially, technology forputting together some wafers (e.g., refer to Published UnexaminedJapanese Patent Application No. H5-160340, Published Unexamined JapanesePatent Application No. H6-268154, Koyanagi, M., Kurino, H., Lee, K-W.,Sakuma, K., Miyakawa, N., Itani, H., “Future System-on-Silicon LSIChips”, IEEE MICRO, Vol. 18, No. 4, pp. 17-22, 1998) have been recentlydeveloped. Therefore, after a manufacturer of the image sensorsindividually makes an LSI implementing on some photo-receptor elements,an LSI implementing on some charge amplifiers, an LSI implementing onsome A/D converters and an LSI implementing on some digital circuits, hecan stack these LSIs as one of the photo-receptor elements, one of thecharge amplifiers, one of the A/D converters and one of the digitalcircuits are arranged vertically. Thus, since even LSIs manufactured insome difference processes, which had already been checked, are stackedeasily, a yield of the LSIs increases. Moreover, since technologystacking many chips (e.g., refer to Nikkei Microdevices, June 2000, pp.62-79, Nikkei Microdevices June 2000, pp. 157-164, Nikkei MicrodevicesJune 2000, pp. 176) have been recently developed, the manufacturer ofthe image sensors has been able to make a high-performance image sensoreasily.

By the way, there is a problem that it is difficult forthree-dimensional LSI technology to increase the number of verticalsignal lines, while the three-dimensional LSI technology can increasethe number of transistors. The reason is that line width of the verticalsignal lines is much wider than line width of signals on animplementation surface of an LSI. Moreover, the transistors can not bearranged at a place where the vertical lines are arranged. Therefore,even though a designer of an image sensor uses the three-dimensional LSItechnology, some transistors in a specific circuit finally must beimplemented on a specific LSI. In short, the designer of the imagesensor can not increase the number of pixels of the image sensor easily.

On the other hand, this inventor has developed a visual device as adevice controlling a moving camera and carrying out image processing(e.g., refer to PCT Publication Number WO 00/16259). The visual devicesearches an object and carries out image processing of the object, bycontrolling a mechanism of pan, tilt and zoom. Image processing carriedout by the visual device is mostly local processing, and the localprocessing can be carried out in parallel by array operation unitsarranged in the shape of a two-dimensional lattice. In a case that thevisual device is embedded in an image sensor, each of the arrayoperation units carries out some local processings, using some pixeldata generated from some photo-receptor elements. Therefore, for someapplications of the image sensor, the image sensor has better adopt sucha type as some adjoining pixel data are inputted by a digital circuit,rather than a pixel-parallel type of image sensors. In this case,furthermore, only one A/D converter is desired for plurality ofphoto-receptor elements. Therefore, even though the number of pixels ofthe image sensor increases, a designer of the image sensor does notalways have to increase the number of the A/D converters and the digitalcircuits. Of course, since all of the A/D converters and all of thedigital circuits can work in parallel, performance of the image sensorseldom drops.

Considering these facts, an image sensor whose resolution andperformance are high comes to be manufactured because some sensormodules are arranged in the shape of a two-dimensional lattice in theimage sensor, some photo-receptor elements are arranged in the shape ofa two-dimensional lattice in each of the sensor modules, and moreover,each of the sensor modules generates a pixel signal from thephoto-receptor elements, in order.

Now, for a past image sensor, its specification had to be decided indesigning. Of course, some electronic circuits can be changed aftermanufacturing the image sensor, by using an FPGA (Field ProgrammableGate Array) and a CPLD (Complex Programmable Logic Device). However, theimage sensor needs electronic circuits for the FPGA and the CPLD, a setof large memories and many signal lines from an external part. On theother hand, when each of sensor modules comprises many photo-receptorelements in the above image sensor, an implementation area of each ofdigital circuits also increases in proportion to the number ofphoto-receptor elements. Therefore, each of the digital circuits cancomprise a processor and a set of large memories. Since the memories canstore all pixel signals generated by the sensor module, the processorcan refer the enormous number of pixel patterns consisting of all pixelsignals. Suppose, thus, that combinations of a memory datum, a memoryaddress and a write clock signal are assigned to these patterns. Theprocessor can write a suitable memory datum at any memory address,according to the write clock signal. In addition, if at least one partof the set of memories is non-volatile, the part of the memories canremain storing the memory datum. Therefore, the processor can changeeven a program stored in the part of the memories. Thus, after amanufacturer of image sensors once made an image sensor, he can change aprogram if desired. Moreover, he can omit signal lines supplying allsets of memories with the program.

Considering these facts, an image sensor comes to change a program inall sets of memories simultaneously because light with a specificpattern is applied to all photo-receptor elements in the image sensor.

In the present invention described in claims, a visual device analyzesgeometry of an object in a digital image, by repeating local processingfor each pixel of the digital image, while it separates an object areaand a background area quickly by using a formed edge-information image.In addition, in the present invention described in claims, an arrayoperation unit and a virtual array operation unit transmit a calculationdatum effectively, by designing a controller possible to reply a RECEIVEimmediately after receiving a SEND, followed by transmitting thecalculation datum counter-clockwisely and clockwisely. In addition, thepresent invention described in claims realizes an interlocked counteralways possible to adjust its count number, according to someinterlocking signals outputted by other interlocked counters, eventhough some of the interlocked counters do not communicate theirinterlocking signals with others. Finally, in the present inventiondescribed in claims an image sensor, whose resolution is high and whichis fast, is manufactured, by outputting some pixel signals from each ofsensor modules comprising photo-receptor elements arranged in the shapeof a two-dimensional lattice.

SUMMARY OF THE INVENTION

The invention described in claim 1 is a visual device, for at least oneobject in an animation image comprising plurality of digital images,comprising: a first image memorizing means memorizing said plurality ofdigital images in order; an edge-information generation means generatinga rough edge-information image from said plurality of digital images; anedge-information formation means forming said rough edge-informationimage into a formed edge-information image by using said digital images;and a geometrical analysis means generating a form-size-informationimage by detecting position, size and form of at least one said objectin said digital image from said formed edge-information image, whereinsaid geometrical analysis means comprises: a position/size/inclinationdetection means generating an inclination-size-information image fromsaid formed edge-information image; and a position/size/form detectionmeans generating said form-size-information image from said formededge-information image and said inclination-size-information image. Inthe present invention, a data processing device consisting of pluralityof array operation units arranged in the shape of a two-dimensionallattice may realize one or more different means of all means, or allsaid means. Said position/size/inclination detection means suitablydivides contour of said object represented by formed edge informationconstructing each pixel of said formed edge-information image into somecontours, by carrying out eight-neighbor processing for said formededge-information image, Moreover, it generates inclination-sizeinformation constructing each pixel of said inclination-size-informationimage, by calculating inclination for each of said contours divided. Aposition/size/form detection means collects said inclination-sizeinformation at a pixel every said object, according to collecting saidformed edge information at a pixel every said object, and generatesform-size information representing form of said object. Therefore, saidgeometrical analysis means can generate said form-size-information imagerepresenting position, size and said form of at least one said object insaid digital image. Since said array operation units can always detectsaid position, said size and said form of said object in said animationimage, only by carrying out local processing repeatedly, in the presentinvention, many problems on recognition of said object are solved verywell.

The invention described in claim 2 is a visual device, for at least oneobject in an animation image comprising plurality of digital images,comprising: a first image memorizing means memorizing said plurality ofdigital images in order; an edge-information generation means generatinga rough edge-information image from said plurality of digital images; afirst edge-information formation means forming said roughedge-information image into a first formed edge-information image byusing said digital image; a position/size detection means generatingfirst redundant-information image, by detecting position and size of atleast one said object segmented by first formed edge informationconstructing said first formed edge-information image; a figure/groundseparation means generating an object-area image representing at leastone object area of at least one said object segmented by said firstformed edge information, by using plurality of nonlinear oscillators;and a second image memorizing means memorizing said object-area image inan appointed period, wherein said figure/ground separation meansseparates at least one said object area from a background area in saiddigital image, by inputting all of first redundant informationconstructing said first redundant-information image to correspondingsaid nonlinear oscillators as external noise, respectively. In thepresent invention, a data processing device consisting of plurality ofarray operation units arranged in the shape of a two-dimensional latticemay realize one or more different means of all means, or all said means.Said first redundant information constructing each pixel of said firstredundant-information image represents the number of said first formededge-information collected at a pixel. Moreover, said pixel representsapproximate position of a center of gravity of a corresponding saidobject. On the other hand, in said figure/ground separation means, saidnonlinear oscillator is implemented at each of said array operationunits arranged in the shape of a two-dimensional lattice. Moreover, eachof said nonlinear oscillators is connected with plurality of nonlinearoscillators at its neighbors by positive connection value, and withplurality of nonlinear oscillators around said neighbors by negativeconnection value. Suppose that the difference of phases of a set of saidnonlinear oscillators becomes large. Note that said first formed edgeinformation constructing said first formed edge-information image is putbetween said nonlinear oscillators. Suppose, moreover, that thedifference of other sets of said nonlinear oscillators becomes small.Said figure/ground separation means can separate at least one saidobject area of said objects from said background area. Since each saidfirst redundant information is inputted by a corresponding saidnonlinear oscillator as said external noise, phase of said nonlinearoscillator inputting said first redundant information which is not zerois shifting from phase of other said nonlinear oscillators. In thiscase, said nonlinear oscillators at neighbors of said nonlinearoscillator inputting said first redundant information which is not zeroalso attract said nonlinear oscillators at their neighbors. As a result,phase of plurality of said nonlinear oscillators within at least onesaid object area shifts fast from phase of other said nonlinearoscillators. Since said figure/ground separation means can quicklyseparate at least one said object area from said background area in thepresent invention, many problems on separation of said object and saidbackground are solved very well.

The invention described in claim 3 is a visual device comprising atleast one data processing device consisting of plurality of arrayoperation units arranged in a shape of a two-dimensional lattice,comprising: a position/size/inclination detection means generating aninclination-size-information image from a binary image; and aposition/size/form detection means generating a form-size-informationimage from said binary image and said inclination-size-informationimage, wherein said form-size-information image represents position,size and form of at least one object in said binary image, by thatform-size information constructing each pixel of saidform-size-information image represents said form and said size of saidobject. The present invention uses an edge-information image and acolor-information image and so on as said binary image. Note that theyare formed as almost all of their line width is two or three pixels. Inthe present invention, moreover, said position/size/inclinationdetection means and said position/size/form detection means may berealized by two said data processing devices, respectively, or one saiddata processing device. In a case that said binary image representscontour of said object, said position/size/inclination detection meansmakes neighbor size of local processing carried out in each of saidarray operation units small. In particular, by setting said neighborsize to eight neighbors, it can hash said contour and generateinclination-size information constructing each pixel of saidinclination-size-information image from some said contours hashed. Here,inclination-size information consists of redundant information and aninclination angle for said contour, and said inclination angle isrepresented within zero or more degrees and less than 180 degrees from ahorizontal axis. Said position/size/form detection means can detect saidposition, said size and said form every said object, by collecting saidinclination-size information at each pixel. Note that it collectsinformation of each pixel of said binary image together. Since thepresent invention can detect said position, said size and said form ofsaid objects, in spite of the number of said objects in said binaryimage, many problems on recognition of said objects are solved verywell.

The invention described in claim 4 is a visual device comprising atleast one data processing device consisting of plurality of arrayoperation units arranged in a shape of a two-dimensional lattice,comprising: a position/size/inclination detection means generating aninclination-size-information image from a binary image; and aposition/size/form detection means generating a form-size-informationimage from said binary image and said inclination-size-informationimage, wherein said form-size-information image represents texture of atleast one object in said binary image, by that form-size informationconstructing each pixel of said form-size-information image representsform and size of said object. The present invention uses anedge-information image and a color-information image and so on as saidbinary image. Note that they are formed as almost all of their linewidth is two or three pixels. In the present invention, moreover, saidposition/size/inclination detection means and said position/size/formdetection means may be realized by two said data processing devices,respectively, or one said data processing device. In a case that saidbinary image represents said texture of said object, saidposition/size/inclination detection means makes neighbor size of localprocessing carried out in each of said array operation units small. Inparticular, by setting said neighbor size to eight neighbors, it candivide said texture into some line segments and generateinclination-size information constructing each pixel of saidinclination-size-information image from some said line segments. Here,inclination-size information consists of redundant information and aninclination angle for said line segment. Moreover, said inclinationangle is represented within zero or more degrees and less than 180degrees from a horizontal axis. Said position/size/form detection meanscan detect said texture every said line segment covering said object, bycollecting said inclination-size information at each pixel. Note that itcollects information of each pixel of said binary image together. Sincethe present invention can detect said texture of said objects, in spiteof the number of said objects in said binary image, many problems onrecognition of said objects are solved very well.

The invention described in claim 5 is a visual device comprising a dataprocessing device consisting of plurality of array operation unitsarranged in a shape of a two-dimensional lattice, wherein each of saidarray operation units comprises: a means for initializing said arrayoperation unit; a means for finishing processing if there is no binaryinformation or inclination-size information to be inputted; a means forinputting said binary information and inclination-size information; ameans for separating said binary information and inclination-sizeinformation; a means for transforming said binary information intoredundant information; a means for transforming said inclination-sizeinformation into transfer-source inclination-redundant information; ameans for calculating a center of gravity from neighbors of a band-pixelvalue in a redundant-information image representing said redundantinformation, and converting imagery of a transfer value derived fromsaid center of gravity to a band-pixel value of a transfer-value image;a means for transferring each of band-pixel values in a transfer-sourceinclination-redundant-information image representing transfer-sourceinclination-redundant information to a transfer position, according tosaid transfer value, for each inclination and each transfer source; ameans for transferring said band-pixel value in saidredundant-information image to said transfer position, according to saidtransfer value; a means for updating each of said band-pixel values insaid transfer-source inclination-redundant-information image to asummation of a summation of all of said band-pixel values in saidtransfer-source inclination-redundant-information image which havealready been transferred and a value corresponding to saidinclination-size information among said band-pixel values in saidtransfer-source inclination-redundant-information image which havealready been transferred, for each inclination and each of saidtransfer-sources; a means for updating said band-pixel value in saidredundant-information image to a summation of all of said band-pixelvalues in said redundant-information image which have already beentransferred; and a means for outputting each of said band-pixel valuesin said transfer-source inclination-redundant-information image. Inshort, this is the enforcement form of an algorithm for realizing afunction offered by said array operation units by using digitaltechnology. Said array operation units were arranged in a shape of atwo-dimensional lattice, followed by connecting said array operationunits and their neighbors each to each. After initializing eachparameter in said array operation units, the present invention inputs abinary image consisting of said binary information and aninclination-redundant-information image consisting of saidinclination-size information every pixel if desired. Moreover, itcarries out a sequence of processes from calculating said center ofgravity to outputting each band-pixel value of saidredundant-information image and said transfer-sourceinclination-redundant-information image one by one. The presentinvention repeats a sequence of these processes until said binary imageor said inclination-size-information image comes not to be inputted.Since the present invention can work said array operation units inparallel, many problems on detection of position, size and form ofobjects are solved very well.

The invention described in claim 6 is a visual device comprising a dataprocessing device consisting of plurality of array operation unitsarranged in a shape of a two-dimensional lattice, wherein each of saidplurality of array operation units comprises: a means for initializingsaid array operation unit; a means for finishing processing if there isno binary information or inclination-size information to be inputted; ameans for inputting said binary information and inclination-sizeinformation; a means for separating said binary information andinclination-size information; a means for transforming said binaryinformation into redundant information; a means for transforming saidinclination-size information into transfer-source inclination-redundantinformation; a means for calculating a center of gravity from neighborsof a band-pixel value in a redundant-information image representing saidredundant information, and converting imagery of a transfer valuederived from said center of gravity to a band-pixel value of atransfer-value image; a means for transferring each of band-pixel valuesin a transfer-source inclination-redundant-information imagerepresenting transfer-source inclination-redundant information to atransfer position, according to said transfer value, for eachinclination and each transfer source; a means for transferring saidband-pixel value in said redundant-information image to said transferposition, according to said transfer value; a means for updating each ofsaid band-pixel values in said transfer-sourceinclination-redundant-information image to a summation of a summation ofall of said band-pixel values in said transfer-sourceinclination-redundant-information image which have already beentransferred and a value corresponding to said inclination-sizeinformation among said band-pixel values in said transfer-sourceinclination-redundant-information image which have already beentransferred, for each inclination and each of said transfer-sources; ameans for updating said band-pixel value in said redundant-informationimage to a summation of all of said band-pixel values in saidredundant-information image which have already been transferred; a meansfor discriminating form from all of said band-pixel values in saidtransfer-source inclination-redundant-information image; a means forgenerating each of band-pixel values in a form-size-information imagerepresenting form-size information from said band-pixel values in saidredundant-information image and a discrimination result of said form;and a means for outputting each of said band-pixel values in saidform-size-information image. In short, this is the enforcement form ofan algorithm for realizing a function offered by said array operationunits by using digital technology. Said array operation units werearranged in a shape of a two-dimensional lattice, followed by connectingsaid array operation units and their neighbors each to each. Afterinitializing each parameter in said array operation units, the presentinvention inputs a binary image consisting of said binary informationand an inclination-redundant-information image consisting of saidinclination-size information every pixel if desired. Moreover, itcarries out a sequence of processes from calculating said center ofgravity to outputting each band-pixel value of saidform-size-information image one by one. The present invention repeats asequence of these processes until said binary image or saidinclination-size-information image comes not to be inputted. Since thepresent invention can work said array operation units in parallel, manyproblems on detection of position, size and said form of objects aresolved very well.

The invention described in claim 7 is a visual device comprising a dataprocessing device consisting of plurality of array operation unitsarranged in a shape of a two-dimensional lattice, wherein each of saidarray operation units comprises: a means for inputting a correspondingpixel in a binary image; a means for inputting a corresponding pixel ina gray-scale image; a means for calculating plurality of parameters in anonlinear oscillator; and a means for outputting a calculation result ofsaid nonlinear oscillator, wherein said nonlinear oscillator separatesat least one object area segmented by said binary image from abackground area, by dealing with said corresponding pixel in saidgray-scale image as an external noise. In the present invention, aformed edge-information image is mainly used as said binary image, and aredundant-information image corresponding to said binary image is usedas said gray-scale image. Therefore, redundant information correspondingto approximate position of a center of gravity of at least one saidobject area segmented by said binary image becomes a positive number,and others of said redundant-information become zero. In addition, thebigger said object becomes, the larger said redundant informationbecomes. Since all of said nonlinear oscillators input saidcorresponding redundant information as said external noise,respectively, phase of at least one said nonlinear oscillator inputtingsaid redundant information which is not zero gains or loses againstphase of remaining said nonlinear oscillators. Moreover, this saidnonlinear oscillator inputting said redundant information which is notzero attracts phase of plurality of said nonlinear oscillators at itsneighbors toward its said phase. As a result, phase of plurality of saidnonlinear oscillators within at least one said object area segmented bysaid binary image and phase of plurality of said nonlinear oscillatorswithin a background area shift quickly each other. Since the presentinvention separates at least one said object area and said backgroundarea fast, many problems on separation of objects and background aresolved very well.

The invention described in claim 8 is a visual device comprisingplurality of array operation units arranged in a shape of atwo-dimensional lattice, wherein each of said calculation data in eachof said array operation units is transmitted counter-clockwisely betweenplurality of said array operation units arranged in a shape of atwo-dimensional lattice, by that each of said array operation unitscomprises: a means for sending said calculation datum calculated in saidarray operation unit to said array operation units at said fourneighbors; a means for transmitting said calculation datum received fromsaid array operation unit on a left side among said four neighbors to atleast one of said array operation unit on a right side and said arrayoperation unit on an upper side; a means for transmitting saidcalculation datum received from said array operation unit on a lowerside among said four neighbors to at least one of said array operationunit on an upper side and said array operation unit on a left side; ameans for transmitting said calculation datum received from said arrayoperation unit on a right side among said four neighbors to at least oneof said array operation unit on a left side and said array operationunit on a lower side; and a means for transmitting said calculationdatum received from said array operation unit on an upper side amongsaid four neighbors to at least one of said array operation unit on alower side and said array operation unit on a right side. The presentinvention can transmit said calculation datum to voluntary said arrayoperation units within a square area decided by max transmission times.Of course, the present invention can transmit said calculation datumonly to a voluntary rectangular area and a circular area, by arranginghorizontal transmission times and vertical transmission times. In a casethat said array operation unit received said calculation datum from saidarray operation unit on a left side, said array operation unit cantransmit said calculation datum to said array operation unit on a righthand if said horizontal transmission times is less than max transmissiontimes. Here, if said vertical transmission times is zero and less thanmax transmission times, said array operation unit can transmit saidcalculation datum to said array operation unit on an upper side. In acase that said array operation unit received said calculation datum fromsaid array operation unit on a lower side, said array operation unit cantransmit said calculation datum to said array operation unit on an upperhand if said vertical transmission times is less than max transmissiontimes. Here, if said horizontal transmission times is zero and less thanmax transmission times, said array operation unit can transmit saidcalculation datum to said array operation unit on a left side. In a casethat said array operation unit received said calculation datum from saidarray operation unit on a right side, said array operation unit cantransmit said calculation datum to said array operation unit on a lefthand if said horizontal transmission times is less than max transmissiontimes. Here, if said vertical transmission times is zero and less thanmax transmission times, said array operation unit can transmit saidcalculation datum to said array operation unit on a lower side. In acase that said array operation unit received said calculation datum fromsaid array operation unit on an upper side, said array operation unitcan transmit said calculation datum to said array operation unit on alower hand if said vertical transmission times is less than maxtransmission times. Here, if said horizontal transmission times is zeroand less than max transmission times, said array operation unit cantransmit said calculation datum to said array operation unit on a rightside. Since the present invention transmits said calculation datumcounter-clockwisely in a shape of a spiral, it can distributecommunication load of said array operation units. Therefore, manyproblems on sharing said calculation datum between said array operationunits are solved very well.

The invention described in claim 9 is a visual device comprisingplurality of array operation units arranged in a shape of atwo-dimensional lattice, wherein each of said calculation data in eachof said array operation units is transmitted clockwisely betweenplurality of said array operation units arranged in a shape of atwo-dimensional lattice, by that each of said array operation unitscomprises: a means for sending said calculation datum calculated in saidarray operation unit to said array operation units at said fourneighbors; a means for transmitting said calculation datum received fromsaid array operation unit on a left side among said four neighbors to atleast one of said array operation unit on a right side and said arrayoperation unit on a lower side; a means for transmitting saidcalculation datum received from said array operation unit on a lowerside among said four neighbors to at least one of said array operationunit on an upper side and said array operation unit on a right side; ameans for transmitting said calculation datum received from said arrayoperation unit on a right side among said four neighbors to at least oneof said array operation unit on a left side and said array operationunit on an upper side; and a means for transmitting said calculationdatum received from said array operation unit on an upper side amongsaid four neighbors to at least one of said array operation unit on alower side and said array operation unit on a left side. The presentinvention can transmit said calculation datum to voluntary said arrayoperation units within a square area decided by max transmission times.Of course, the present invention can transmit said calculation datumonly to a voluntary rectangular area and a circular area, by arranginghorizontal transmission times and vertical transmission times. In a casethat said array operation unit received said calculation datum from saidarray operation unit on a left side, said array operation unit cantransmit said calculation datum to said array operation unit on a righthand if said horizontal transmission times is less than max transmissiontimes. Here, if said vertical transmission times is zero and less thanmax transmission times, said array operation unit can transmit saidcalculation datum to said array operation unit on a lower side. In acase that said array operation unit received said calculation datum fromsaid array operation unit on a lower side, said array operation unit cantransmit said calculation datum to said array operation unit on an upperhand if said vertical transmission times is less than max transmissiontimes. Here, if said horizontal transmission times is zero and less thanmax transmission times, said array operation unit can transmit saidcalculation datum to said array operation unit on a right side. In acase that said array operation unit received said calculation datum fromsaid array operation unit on a right side, said array operation unit cantransmit said calculation datum to said array operation unit on a lefthand if said horizontal transmission times is less than max transmissiontimes. Here, if said vertical transmission times is zero and less thanmax transmission times, said array operation unit can transmit saidcalculation datum to said array operation unit on an upper side. In acase that said array operation unit received said calculation datum fromsaid array operation unit on an upper side, said array operation unitcan transmit said calculation datum to said array operation unit on alower hand if said vertical transmission times is less than maxtransmission times. Here, if said horizontal transmission times is zeroand less than max transmission times, said array operation unit cantransmit said calculation datum to said array operation unit on a leftside. Since the present invention transmits said calculation datumclockwisely in a shape of a spiral, it can distribute communication loadof said array operation units. Therefore, many problems on sharing saidcalculation datum between said array operation units are solved verywell.

The invention described in claim 10 is a visual device comprisingplurality of virtual array operation units arranged in a shape of atwo-dimensional lattice, wherein each of said calculation data in eachof said virtual array operation units is transmitted counter-clockwiselybetween plurality of said virtual array operation units arranged in ashape of a two-dimensional lattice, by that each of said virtual arrayoperation units comprises: a means for sending said calculation datumcalculated in said virtual array operation unit to said virtual arrayoperation units at said four neighbors; a means for transmitting saidcalculation datum received from said virtual array operation unit on aleft side among said four neighbors to at least one of said virtualarray operation unit on a right side and said virtual array operationunit on an upper side; a means for transmitting said calculation datumreceived from said virtual array operation unit on a lower side amongsaid four neighbors to at least one of said virtual array operation uniton an upper side and said virtual array operation unit on a left side; ameans for transmitting said calculation datum received from said virtualarray operation unit on a right side among said four neighbors to atleast one of said virtual array operation unit on a left side and saidvirtual array operation unit on a lower side; and a means fortransmitting said calculation datum received from said virtual arrayoperation unit on an upper side among said four neighbors to at leastone of said virtual array operation unit on a lower side and saidvirtual array operation unit on a right side. The present invention cantransmit said calculation datum to voluntary said virtual arrayoperation units within a square area decided by max transmission times.Of course, the present invention can transmit said calculation datumonly to a voluntary rectangular area and a circular area, by arranginghorizontal transmission times and vertical transmission times. In a casethat said virtual array operation unit received said calculation datumfrom said virtual array operation unit on a left side, said virtualarray operation unit can transmit said calculation datum to said virtualarray operation unit on a right hand if said horizontal transmissiontimes is less than max transmission times. Here, if said verticaltransmission times is zero and less than max transmission times, saidvirtual array operation unit can transmit said calculation datum to saidvirtual array operation unit on an upper side. In a case that saidvirtual array operation unit received said calculation datum from saidvirtual array operation unit on a lower side, said virtual arrayoperation unit can transmit said calculation datum to said virtual arrayoperation unit on an upper hand if said vertical transmission times isless than max transmission times. Here, if said horizontal transmissiontimes is zero and less than max transmission times, said virtual arrayoperation unit can transmit said calculation datum to said virtual arrayoperation unit on a left side. In a case that said virtual arrayoperation unit received said calculation datum from said virtual arrayoperation unit on a right side, said virtual array operation unit cantransmit said calculation datum to said virtual array operation unit ona left hand if said horizontal transmission times is less than maxtransmission times. Here, if said vertical transmission times is zeroand less than max transmission times, said virtual array operation unitcan transmit said calculation datum to said virtual array operation uniton a lower side. In a case that said virtual array operation unitreceived said calculation datum from said virtual array operation uniton an upper side, said virtual array operation unit can transmit saidcalculation datum to said virtual array operation unit on a lower handif said vertical transmission times is less than max transmission times.Here, if said horizontal transmission times is zero and less than maxtransmission times, said virtual array operation unit can transmit saidcalculation datum to said virtual array operation unit on a right side.Since the present invention transmits said calculation datumcounter-clockwisely in a shape of a spiral, it can distributecommunication load of said virtual array operation units. Therefore,many problems on sharing said calculation datum between said virtualarray operation units are solved very well.

The invention described in claim 11 is a visual device comprisingplurality of virtual array operation units arranged in a shape of atwo-dimensional lattice, wherein each of said calculation data in eachof said virtual array operation units is transmitted clockwisely betweenplurality of said virtual array operation units arranged in a shape of atwo-dimensional lattice, by that each of said virtual array operationunits comprises: a means for sending said calculation datum calculatedin said virtual array operation unit to said virtual array operationunits at said four neighbors; a means for transmitting said calculationdatum received from said virtual array operation unit on a left sideamong said four neighbors to at least one of said virtual arrayoperation unit on a right side and said virtual array operation unit ona lower side; a means for transmitting said calculation datum receivedfrom said virtual array operation unit on a lower side among said fourneighbors to at least one of said virtual array operation unit on anupper side and said virtual array operation unit on a right side; ameans for transmitting said calculation datum received from said virtualarray operation unit on a right side among said four neighbors to atleast one of said virtual array operation unit on a left side and saidvirtual array operation unit on an upper side; and a means fortransmitting said calculation datum received from said virtual arrayoperation unit on an upper side among said four neighbors to at leastone of said virtual array operation unit on a lower side and saidvirtual array operation unit on a left side. The present invention cantransmit said calculation datum to voluntary said virtual arrayoperation units within a square area decided by max transmission times.Of course, the present invention can transmit said calculation datumonly to a voluntary rectangular area and a circular area, by arranginghorizontal transmission times and vertical transmission times. In a casethat said virtual array operation unit received said calculation datumfrom said virtual array operation unit on a left side, said virtualarray operation unit can transmit said calculation datum to said virtualarray operation unit on a right hand if said horizontal transmissiontimes is less than max transmission times. Here, if said verticaltransmission times is zero and less than max transmission times, saidvirtual array operation unit can transmit said calculation datum to saidvirtual array operation unit on a lower side. In a case that saidvirtual array operation unit received said calculation datum from saidvirtual array operation unit on a lower side, said virtual arrayoperation unit can transmit said calculation datum to said virtual arrayoperation unit on an upper hand if said vertical transmission times isless than max transmission times. Here, if said horizontal transmissiontimes is zero and less than max transmission times, said virtual arrayoperation unit can transmit said calculation datum to said virtual arrayoperation unit on a right side. In a case that said virtual arrayoperation unit received said calculation datum from said virtual arrayoperation unit on a right side, said virtual array operation unit cantransmit said calculation datum to said virtual array operation unit ona left hand if said horizontal transmission times is less than maxtransmission times. Here, if said vertical transmission times is zeroand less than max transmission times, said virtual array operation unitcan transmit said calculation datum to said virtual array operation uniton an upper side. In a case that said virtual array operation unitreceived said calculation datum from said virtual array operation uniton an upper side, said virtual array operation unit can transmit saidcalculation datum to said virtual array operation unit on a lower handif said vertical transmission times is less than max transmission times.Here, if said horizontal transmission times is zero and less than maxtransmission times, said virtual array operation unit can transmit saidcalculation datum to said virtual array operation unit on a left side.Since the present invention transmits said calculation datum clockwiselyin a shape of a spiral, it can distribute communication load of saidvirtual array operation units. Therefore, many problems on sharing saidcalculation datum between said virtual array operation units are solvedvery well.

The invention described in claim 12 is a visual device comprisingplurality of array operation units or plurality of virtual arrayoperation units arranged in a shape of a two-dimensional lattice,wherein each of all of said array operation units and all of saidvirtual array operation units comprises a processor, a set of memoriesand plurality of controllers, wherein at least one said controllertransmits a calculation datum only at most a number of times related toa number of said controller, to which said processor wrote saidcalculation data, by that a number is assigned to at least two saidcontrollers at intervals of an appointed number, and each of all of saidcontrollers, to which said number is assigned, communicates with atleast one of said controllers, whose number shifts only said appointednumber from said number of said controller, in each of adjoining saidarray operation units and adjoining said virtual array operation units,for each of all of said array operation units and all of said virtualarray operation units. In the present invention, whenever saidcalculation datum is transmitted by said controller, said number of saidcontroller becomes large or small. Moreover, if said calculation datumis transmitted to said controller, whose number is the largest or thesmallest, said calculation datum is destroyed. Therefore, saidcalculation datum is transmitted to a specific direction only desiredtimes, only by that said processor writes said calculation datum to aspecific said controller. Moreover, said processor does not have tojudge end of transmitting said calculation datum. In addition, saidprocessor can also calculate transmission times, by reading saidcalculation datum from a specific said controller. Therefore, manyproblems on transmitting said calculation datum are solved very well.

The invention described in claim 13 is an interlocked counter comprisinga synchronous counter, a logic gate for judging end-value, a logic gatefor amplifying interlocking signal, at least one latch circuit forinterlocking signal, a logic gate for interlocking signal, and a logicgate for enable signal, wherein behavior of said synchronous counter isstopped when a count number arrived at an end value, by that saidsynchronous counter counts a number of pulses of a clock signal whensaid synchronous counter inputted an enable signal, said logic gate forjudging end-value generates an interlocking signal when said countnumber outputted by a synchronous counter coincided with said end value,said logic gate for amplifying interlocking signal amplifies saidinterlocking signal in order to output to an external part, and saidlogic gate for enable signal generates said enable signal when saidinterlocking signal is not generated, and said behavior of saidsynchronous counter is restarted, by that each of said latch circuitsfor interlocking signal memorizes one of said interlocking signalsinputted from an external part when said interlocking signal outputtedby said logic gate for judging end-value is not generated, said logicgate for interlocking signal judges whether all of said latch circuitsfor interlocking signal memorize said interlocking signals, and saidlogic gate for enable signal generates said enable signal when all ofsaid latch circuits for interlocking signal memorize said interlockingsignals. Said synchronous counter is an up-counter or a down-counterwhich has one or more bits, and can count said pulses of said clocksignal only when said enable signal is active. A clock terminal of saidsynchronous counter can be for either rising edge or falling edge. Ifsaid count number is a maximum value or a minimum value, said logic gatefor judging end-value makes said interlocking signal active. Otherwise,said interlocking signal is inactive. Since said interlocking signal issent to said external part, a logic gate whose drive performance is highis used as said logic gate for amplifying interlocking signal. When saidinterlocking signal is inactive, said logic gate for enable signal makessaid enable signal active. Therefore, after said synchronous countercounted said pulses of said clock signal until said count number arrivesat said maximum value or said minimum value, said interlocking signalbecomes active, followed by that said synchronous counter stops. Whensaid interlocking signal is active, each of said latch circuits ofinterlocking signal becomes possible to memorize that one of at leastone said interlocking signal inputted from said external part is active.Otherwise, each of said latch circuits for interlocking signal isresetted. When all of said latch circuits for interlocking signalmemorized said interlocking signals, output of said logic gate forinterlocking signal becomes active. When output of a logic gate forinterlocking signal is active, said logic gate for enable signal makessaid enable signal active, in spite of said interlocking signaloutputted by said logic gate for judging end-value. Therefore, eventhough said behavior of said synchronous counter is stopping, saidbehavior of said synchronous counter is restarted if all of saidinterlocking signals inputted from said external part are active. Sincethe present invention can control said behavior of said synchronouscounter by at least one said interlocking signal inputted from saidexternal part, many problems on said behavior of said synchronouscounter are solved very well.

The invention described in claim 14 is an interlocked counter comprisinga synchronous counter which comprises at least one of a synchronousclear means and a synchronous load means, a logic gate for judgingend-value, a logic gate for amplifying interlocking signal, at least onelatch circuit for interlocking signal, a logic gate for interlockingsignal, a logic gate for enable signal, and a logic gate forinitialization, wherein behavior of said synchronous counter is stoppedwhen a count number arrived at an end value, by that said synchronouscounter counts a number of pulses of a clock signal when saidsynchronous counter inputted an enable signal, said logic gate forjudging end-value generates an interlocking signal when said countnumber outputted by a synchronous counter coincided with said end value,said logic gate for amplifying interlocking signal amplifies saidinterlocking signal in order to output to an external part, and saidlogic gate for enable signal generates said enable signal when saidinterlocking signal is not generated, said behavior of said synchronouscounter is restarted, by that each of said latch circuits forinterlocking signal memorizes one of said interlocking signals inputtedfrom an external part when said interlocking signal outputted by saidlogic gate for judging end-value is not generated, said logic gate forinterlocking signal judges whether all of said latch circuits forinterlocking signal memorize said interlocking signals, and said logicgate for enable signal generates said enable signal when all of saidlatch circuits for interlocking signal memorize said interlockingsignals, and said synchronous clear means and said synchronous loadmeans set an initial value to said synchronous counter by using aninitialization signal, by that said logic gate for initialization signalinputs said interlocking signal outputted by said logic gate for judgingend-value and said enable signal, and generates said initializationsignal. Said synchronous counter is an up-counter or a down-counterwhich has one or more bits. Moreover, it can count said pulses of saidclock signal only when said enable signal is active. A clock terminal ofsaid synchronous counter can be for either rising edge or falling edge.If said count number is a maximum value or a minimum value, said logicgate for judging end-value makes said interlocking signal active.Otherwise, said interlocking signal is inactive. Since said interlockingsignal is sent to said external part, a logic gate whose driveperformance is high is used as said logic gate for amplifyinginterlocking signal. When said interlocking signal is inactive, saidlogic gate for enable signal makes said enable signal active. Therefore,after said synchronous counter counted said pulses of said clock signaluntil said count number arrives at said maximum value or said minimumvalue, said interlocking signal becomes active, followed by that saidsynchronous counter stops. When said interlocking signal is active, eachof said latch circuits of interlocking signal becomes possible tomemorize that one of at least one said interlocking signal inputted fromsaid external part is active. Otherwise, each of said latch circuits forinterlocking signal is resetted. When all of said latch circuits forinterlocking signal memorized said interlocking signals, output of saidlogic gate for interlocking signal becomes active. When output of alogic gate for interlocking signal is active, said logic gate for enablesignal makes said enable signal active, in spite of said interlockingsignal outputted by said logic gate for judging end-value. Therefore,even though said behavior of said synchronous counter is stopping, saidbehavior of said synchronous counter is restarted if all of saidinterlocking signals inputted from said external part are active. Inaddition, when both of said interlocking signal and said enable signalare active, said logic gate for initialization signal makes saidinitialization signal active. In a case that a clear terminal of saidsynchronous counter inputs said initialization signal, said synchronousclear means sets said count number to said maximum value or said minimumvalue. In a case that a load terminal of said synchronous counter inputssaid initialization signal, said synchronous load means sets said countnumber to a suitable said initial value. Therefore, said synchronouscounter can limit said count number within said initial value and saidend value. Since the present invention can control said behavior of saidsynchronous counter by at least one said interlocking signal inputtedfrom said external part, many problems on said behavior of saidsynchronous counter are solved very well.

The invention described in claim 15 is an interlocked counter accordingto claim 13 or 14, which comprises a synchronous oscillator comprising aself-oscillation circuit generating said clock signal, which comprises alatch circuit for synchronous signal, and at least one logic gate foramplifying clock signal, wherein said latch circuit for synchronoussignal inputs said enable signal, an output of said latch circuit forsynchronous signal changes phase of said clock signal, and at least onesaid logic gate for clock signal amplifies said clock signal. Thepresent invention uses a D-latch as said latch circuit for synchronoussignal, and said enable signal is inputted at a gate terminal of saidD-latch. Therefore, said latch circuit for synchronous signal works as abuffer and a NOT gate if said enable signal is active. Otherwise, saidlatch circuit for synchronous signal memorizes an input signal. In acase that an oscillator comprising one or more logic gates like a ringoscillator, an astable multi-vibrator and so on is used as saidself-oscillation circuit, said latch circuit for synchronous signal isused instead of one of said logic gates. Therefore, if said enablesignal is active, said self-oscillation circuit self-oscillates.Otherwise, said self-oscillation circuit is stabilized at a currentstate. said self-oscillation circuit, thus, can lose said phase of saidclock signal until said enable signal becomes active. A NOT gate is usedas said logic gate for amplifying clock signal. Said logic gate foramplifying clock signal amplifies said clock signal generated by saidself-oscillation circuit, if desired. Moreover, said synchronous counterand other electronic circuits are supplied with it. In the presentinvention, said synchronous oscillator does not change voltage of saidclock signal while said synchronous counter is stopping. Therefore, saidsynchronous counter can count all of said pulses of said clock signal.Thus, many problems on said pulses of said clock signal are solved verywell.

The invention described in claim 16 is an interlocked counter accordingto claim 13 or 14, which comprises a synchronous oscillator comprising:a flip-flop circuit for synchronous signal, a synchronous signalamplifier, a loop filter, a voltage controlled oscillator, and at leastone logic gate for amplifying clock signal, wherein said latch circuitfor synchronous signal memorizes said enable signal, said synchronoussignal amplifier amplifies an output of said latch circuit forsynchronous signal, said loop filter reduces a noise included in anoutput of said synchronous signal amplifier, said voltage controlledoscillator generates said clock signal, said voltage controlledoscillator changes phase of said clock signal according to voltageoutputted by said loop filter, and at least one said logic gate forclock signal amplifies said clock signal. The present invention uses aD-flip-flop as said flip-flop circuit for synchronous signal, and saidenable signal is inputted at a D terminal of said D-flip-flop. Note thatsaid clock signal is inputted at a clock terminal of said D-flip flop.Therefore, said D-flip-flop circuit for synchronous signal memorizes thesame signal as said enable signal. An amplifier possible to generatevoltage necessary to control said voltage controlled oscillator is usedas said synchronous signal amplifier. If this voltage is within a gatelevel, a NOT gate and a buffer is used as said synchronous signalamplifier. Otherwise, a general amplifier is used as said synchronoussignal amplifier. A lag filter, a lag lead filter and their variationsare used as said loop filter. Said loop filter reduces a high-frequencynoise included in said output of said synchronous signal amplifier inorder to inhibit jitter of said clock signal outputted by said voltagecontrolled oscillator. A Colpitz oscillator, a Pias oscillator and so onusing a piezoelectric element like a crystal oscillator are used as saidvoltage controlled oscillator, and frequency of said clock signaloutputted by said voltage controlled oscillator is varied by a variablecapacitance diode which changes capacitance according to voltage.Therefore, said voltage controlled oscillator can gain said phase ofsaid clock signal while said flip-flop circuit for synchronous signal ismemorizing an active said enable signal. A NOT gate is used as saidlogic gate for amplifying clock signal. Said logic gate for amplifyingclock signal amplifies said clock signal generated by saidself-oscillation circuit, if desired. Moreover, said synchronous counterand other electronic circuits are supplied with it. In the presentinvention, said synchronous oscillator changes a period of said clocksignal only a little while said synchronous counter is stopping.Therefore, said synchronous oscillator can make the difference of phasesbetween said interlocking signal outputted by said logic gate forjudging end-value and at least one said interlocking signal inputtedfrom said external part as small as possible, seldom affecting behaviorof said other electronic circuits. Thus, many problems on said period ofsaid clock signal are solved very well.

The invention described in claim 17 is an interlocked device comprisingplurality of interlocked counters according to at least one of claim 13to 16, wherein said count numbers of said synchronous counters in saidinterlocked counters are even, by that said plurality of interlockedcounters are arranged on a plane; all distance between adjoining saidinterlocked counters is equal; adjoining said interlocked counterscommunicate said interlocking signals each other; each of saidinterlocked counters memorizes all said interlocking signals outputtedby at least one adjoining said interlocked counter; and said synchronouscounter in each of said interlocked counters stops said behavior untileach of said interlocked counters memorizes all said interlockingsignals. Since plurality of said interlocked counters are arranged in ashape of said square lattice, said hexagonal lattice and so on, all saiddistance between adjoining said interlocked counters becomes equal.Thus, in a case that a signal line of said interlocking signal betweenadjoining said interlocked counters takes the shortest route, allpropagation delay time of said interlocking signal outputted by eachsaid interlocked counter to all adjoining said interlocked counters isequal. Therefore, all phase of said interlocking signals inputted by alladjoining said interlocked counters is also equal. Said interlockedcounter restarts said behavior of said synchronous counter if saidinterlocking signals of all adjoining said interlocked counters areactive. In addition, since said latch circuit for interlocking signal insaid interlocked counter memorizes said interlocking signal inputtedfrom one of adjoining said interlocked counters, said interlockedcounter restarts said behavior of said synchronous counter according toone whose phase is the latest in said interlocking signals of adjoiningsaid interlocked counters, in spite of current said interlocking signalsof adjoining said interlocked counters. Therefore, if all saidinterlocked counters input a clock signal whose phase is even, and if aperiod of said clock signal is much longer than said propagation delaytime of said interlocking signals, all phases of said interlockingsignals coincide. Moreover, said latch circuit for interlocking signalin said interlocked counter memorizes said interlocking signal inputtedfrom one of adjoining said interlocked counters. Here, said phase ofsaid clock signal inputted by one of adjoining said interlocked countersis gaining. Even though said interlocking signal becomes active again,an output of said latch circuit for interlocking signal inputting thissaid interlocking signal also remains active after this saidinterlocking signal outputted by this said interlocked counter becameactive. Therefore, even though said phase of said clock signal inputtedby all of said interlocked counters is not equal, adjoining saidinterlocked counters can receive said interlocking signals each other.The present invention can make said count numbers outputted by saidinterlocked counters coincide, by connecting said interlocked counterseach other. Generally speaking, in distributing said clock signal to awhole of an LSI (Large Scale Integrated Circuit), the higher frequencyof said clock signal becomes, the more propagation delay time of saidclock signal causes trouble. By arranging said interlocked counters onsaid LSI distributedly, however, a divided signal of said clock signalcan be distributed to digital circuits in a whole of LSI. Thus, manyproblems on synchronization of said digital circuits are solved verywell.

The invention described in claim 18 is an image sensor comprisingplurality of sensor modules, each of at least one of which comprises:plurality of pixel cells arranged in a shape of a two-dimensionallattice; charge coupled device arranged along an array of said pixelcells; a drive device for charge transfer; and an output amplifier,wherein each of at least one said pixel cell comprises: a photo-receptorelement converting light to charges; and a charge transfer gate, andeach of at least one said sensor module outputs said charges of saidphoto-receptor elements in all said pixel cells as a pixel signal inorder, according to a pixel synchronous signal outputted by said drivedevice for charge transfer, by that an output of said drive device forcharge transfer make said charge transfer gate in at least one saidpixel cell conduct; said charge coupled device stores said charges ofsaid photo-receptor element via at least one said charge transfer gate;an output of said drive device for charge transfer transmits saidcharges stored in said charge coupled device toward said outputamplifier in order; and said output amplifier amplifies said chargesstored in said charge coupled device in order, in each of at least onesaid sensor module. In many of said image sensors, all of said sensormodules are arranged in a shape of a lattice or a hexagonal lattice. Ofcourse, however, these said sensor modules may be arranged in a shape ofa line or a circle. In addition, all said pixel cells are arranged in ashape of a lattice or a hexagonal lattice. Each of said pixel cellscomprises said photo-receptor element and said charge transfer gate. Aphotodiode, a phototransistor and a HARP (High-gain Avalanche Rushingamorphous Photoconductor) film, and so on are used as saidphoto-receptor element. When said photo-receptor element received saidlight, said photo-receptor element generates said charges in terms ofelectro-optic effect. Note that an electronic circuit is appended tosaid photo-receptor element, in order to store said charges, if desired.Said charge coupled device is arranged with one stroke, along an arrayof said pixel cells comprising said photo-receptor element. In a casethat said drive device for charge transfer makes at least one saidcharge transfer gate conduct, said charges can move to said chargecoupled device. If said drive device for charge transfer applies anappointed voltage to said charge coupled device, said charges move fromsaid photo-receptor element to said charge coupled device. When saiddrive device for charge transfer applied said voltage to said chargecoupled device according to an appointed pattern, said charges stored insaid charge coupled device move in said charge coupled device, in a formof a bucket relay. Therefore, at least one said charge can move toeither one of two terminals of said charge coupled device, according toan order of places where said charges are stored. Said output amplifiercan receive said charges generated by at least one said photo-receptorelement one by one from said charge coupled device, and convert to saidpixel signal in order. In addition, it can be discriminated that saidoutput amplifier outputs said pixel signal because said drive device forcharge transfer outputs said charge synchronous signal after moving saidcharges stored in said charge coupled device. Since each of said sensormodules comprises said drive device for charge transfer, in the presentinvention, said image sensor can output said pixel signalssimultaneously from at least one said sensor module. In order to make anarea sensor, in the present invention, said sensor modules which arejust same are arranged in said shape of a lattice, and many said pixelsignals are outputted via a small number of signal lines. Therefore,many problems on design of said area sensor are solved very well.

The invention described in claim 19 is an image sensor comprisingplurality of sensor modules, each of at least one of which comprises:plurality of pixel cells arranged in a shape of a two-dimensionallattice; a vertical shift register; a horizontal shift register;plurality of row selection gates; plurality of noise cancellers; and anoutput amplifier, wherein each of said pixel cells comprises: aphoto-receptor element converting light to charges; a charge amplifierconverting said charges to voltage; and a column selection gate, andeach of said sensor modules outputs said charges of said photo-receptorelements in at least one said pixel cell as a pixel signal in order,according to a pixel synchronous signal outputted by said horizontalshift register, by that an output of said vertical shift register makesaid column selection gate in at least one said pixel cell conduct; eachaid noise canceller reduces noise of said voltage outputted via at leastone said column selection gate, an output of said horizontal shiftregister make at least one said row selection gate conduct; and saidoutput amplifier amplifies an output of said noise cancellor outputtedvia at least one said row selection gate, in each of said sensormodules. In many of said image sensors, all of said sensor modules arearranged in a shape of a lattice or a hexagonal lattice. Of course,however, these said sensor modules may be arranged in a shape of a lineor a circle. In addition, all said pixel cells are arranged in a shapeof a lattice or a hexagonal lattice, and arrangement of these said pixelcells is represented by at least one column and at least one row. Atleast one said noise canceller and at least one said row selection gateare arranged one by one at every row, respectively. Each of said pixelcells comprises said photo-receptor element, said charge amplifier andsaid column selection gate. A photodiode, a phototransistor and a HARP(High-gain Avalanche Rushing amorphous Photoconductor) film, and so onare used as said photo-receptor element. When said photo-receptorelement received said light, said photo-receptor element generates saidcharges in terms of electro-optic effect. Note that an electroniccircuit is appended to said photo-receptor element, in order to storesaid charges, if desired. Said charge amplifier converts said voltageaccording to amount of said charges. When said vertical shift registerselected one of said columns, said column selection gate in at least onesaid pixel cell included in said column selected is conductive. Saidcharge amplifiers in at least one said pixel cell included in saidcolumn selected are inputted by said noise cancellers, respectively,every said row. At least one said noise canceller reduces said noiseincluded in said voltage outputted by said charge amplifier in at leastone said pixel cell arranged in corresponding said row, respectively.When said horizontal shift register selected one of said rows, said rowselection gate in said row selected is conductive. Said voltage reducedsaid noise by said noise canceller in said row selected is inputted bysaid output amplifier. Since said vertical shift register and saidhorizontal shift register select one of all said pixel cells in anappointed order, said output amplifier can output charges of saidphoto-receptor element in at least one said pixel cell as said pixelsignal. In addition, it can be discriminated that said output amplifieroutputs said pixel signal because said horizontal shift register outputssaid charge synchronous signal after selecting one of said rows. Sinceeach of said sensor modules comprises said vertical shift register andsaid horizontal shift register, in the present invention, said imagesensor can output said pixel signals simultaneously from at least onesaid sensor module. In order to make an area sensor, in the presentinvention, said sensor modules which are just same are arranged in saidshape of a lattice, and many said pixel signals are outputted via asmall number of signal lines. Therefore, many problems on design of saidarea sensor are solved very well.

The invention described in claim 20 is an image sensor according toclaim 18 or 19, wherein a layer in which at least one said sensor moduleis arranged in said shape of a lattice; a layer in which plurality ofA/D converters are arranged in said shape of a lattice; and a layer inwhich plurality of digital circuits are arranged in a shape of saidlattice are stacked, and said charges generated by at least one saidphoto-receptor element are inputted by a corresponding said digitalcircuit as said pixel datum, according to said pixel synchronous signal,in each of at least one said sensor module, by that said pixel signaloutputted by each of said sensor modules is inputted by a different saidsensor module of said sensor modules; each of said A/D convertersconverts said pixel signal to a pixel datum; and said pixel datumoutputted by each of said A/D converters is inputted by at least onedifferent said digital circuit of said digital circuits. In the presentinvention, at least one said sensor module, at least one said A/Dconverter and at least one said digital circuit are arranged in a shapeof a lattice and a hexagonal lattice as arrangement of said sensormodule, arrangement of a corresponding said A/D converter, andarrangement of a corresponding said digital circuit are stackedvertically. When each of at least one said digital circuit comprises abuffer like a shift register, a serial/parallel converter and so on, itremains all of said pixel data outputted by a corresponding said A/Dconverter, according to said pixel synchronous signal. Moreover, it canpick up either one of these said pixel data selectively. Therefore,these said digital circuits can replace an order of all said pixel datainputted with another, respectively. By using three-dimensional LSI(Large Scale Integrated Circuit) technology, in the present invention, asignal line for said pixel signal is wired between said sensor moduleand a corresponding said A/D converter, at least one signal line forsaid pixel datum is wired between said A/D converter and a correspondingsaid digital circuit. Moreover, a signal line for said pixel synchronoussignal is wired between said sensor module and a corresponding saiddigital circuit. Each of at least one said digital circuit inputs saidpixel signal as said pixel datum only from a corresponding said sensormodule. Therefore, even though a number of pixels in said image sensorincreases, each of at least one said digital circuit can input all saidpixel signals outputted by at least one corresponding said sensor moduleas said pixel data in a short time. In the present invention, saidsignal line for said pixel signal from said sensor module to acorresponding said A/D converter, at least one said signal line for saidpixel datum from this A/D converter to a corresponding said digitalcircuit. Moreover, said signal line for said pixel synchronous signalfrom this said sensor module to a corresponding said digital circuit canbe arranged as they do not cross with any other said signals. Therefore,many problems on arrangement of said signal lines in said image sensorare solved very well.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a visual device recognizing position, sizeand form of approximate contours of at least one object in a digitalimage.

FIG. 2 is a block diagram of a visual device separating an object areaof an object in a digital image from background.

FIG. 3 is a block diagram of a visual device recognizing color of anobject in a digital image.

FIG. 4 is a block diagram of a visual device recognizing a pattern of anobject in a digital image.

FIG. 5 is a block diagram of a visual device detecting position, sizeand inclination of an object in a digital image.

FIG. 6 is a block diagram of a visual device recognizing an object in adigital image.

FIG. 7 is a block diagram of a visual device understanding a digitalimage representing at least one object.

FIG. 8 is a block diagram of a visual device which controls a movingcamera and finds out some objects.

FIG. 9 is an explanation view for an image coordinate, in a case that amoving camera rotated as the light axis of its lens is a center ofrotation.

FIG. 10 is a block diagram of a visual device which controls a movingcamera, finds out some objects and counts the number of the objects.

FIG. 11 is a block diagram of some array operation units arranged in theshape of a lattice.

FIG. 12 is an explanation view for eight numbers of eight neighborsordered counter-clockwisely.

FIG. 13 is a flow chart appearing an algorithm of an image memorizationmeans in this enforcement form.

FIG. 14 is an explanation view for generating color information for somespecific colors in a digital image.

FIG. 15 is a flow chart appearing an algorithm of a color-informationgeneration means in this enforcement form.

FIG. 16 is an explanation view for generating rough edge information,using a digital image.

FIG. 17 is a flow chart appearing an algorithm of an edge-informationgeneration means in this enforcement form.

FIG. 18 is an explanation view for forming rough edge information intoformed edge information, using a digital image.

FIG. 19 is a flow chart appearing an algorithm of an edge-informationformation means in this enforcement form.

FIG. 20 is an explanation view for forming low-resolution rough edgeinformation generated from a low-resolution digital image into formededge information.

FIG. 21 is an explanation view for forming formed edge information aftercutting an area of low-resolution rough edge information generated froma low-resolution digital image.

FIG. 22 is an explanation view for detecting position and size ofobjects in an edge-information image.

FIG. 23 is a flow chart appearing an algorithm of a position/sizedetection means in this enforcement form.

FIG. 24 is an explanation view for detecting position and size ofobjects in an object-area image.

FIG. 25 is an explanation view for detecting position, size andinclination of objects in an object-area image.

FIG. 26 is a flow chart appearing an algorithm of aposition/size/inclination detection means in this enforcement form.

FIG. 27 is an explanation view for detecting position, size andinclination of objects in an object-area image.

FIG. 28 is an explanation view for an example of transfer-sourceredundant information.

FIG. 29 is an explanation view for detecting position, size andinclination of texture in a color-information image.

FIG. 30 is an explanation view for detecting position, size andinclination of objects in an edge-information image and outputting aninclination-size-information image.

FIG. 31 is an explanation view for detecting normal direction of linesegments in a formed edge-information image.

FIG. 32 is an explanation view for detecting normal direction ofcross-shaped line segments in a formed edge-information image.

FIG. 33 is an explanation view for detecting normal direction of linesegments constructing a triangle in a formed edge-information image.

FIG. 34 is an explanation view for detecting normal direction of linesegments constructing a rectangle in a formed edge-information image.

FIG. 35 is an explanation view for detecting normal direction of linesegments constructing a rhombus in a formed edge-information image.

FIG. 36 is an explanation view for detecting normal direction of linesegments constructing a circle in a formed edge-information image.

FIG. 37 is an explanation view for generating a transfer-sourceinclination-redundant-information image from a formed edge-informationimage including a line segment and an inclination-size-informationimage.

FIG. 38 is an explanation view for generating a transfer-sourceinclination-redundant-information image from a formed edge-informationimage including a triangle and an inclination-size-information image.

FIG. 39 is an explanation view for generating a transfer-sourceinclination-redundant-information image from a formed edge-informationimage including a rectangle and an inclination-size-information image.

FIG. 40 is an explanation view for generating a transfer-sourceinclination-redundant-information image from a formed edge-informationimage including a rhombus and an inclination-size-information image.

FIG. 41 is an explanation view for generating a transfer-sourceinclination-redundant-information image from a formed edge-informationimage including a circle and an inclination-size-information image.

FIG. 42 is a flow chart appearing an algorithm of a position/size/formdetection means in this enforcement form.

FIG. 43 is an explanation view for outputting a transfer-sourceinclination-redundant-information image after inputting a formededge-information image representing a triangle.

FIG. 44 is an explanation view for outputting a transfer-sourceinclination-redundant-information image after inputting a formededge-information image representing an incomplete triangle.

FIG. 45 is an explanation view for outputting a form-size-informationimage after inputting a formed edge-information image representing atriangle.

FIG. 46 is an explanation view for outputting a form-size-informationimage after inputting a formed edge-information image representingfacial parts.

FIG. 47 is an explanation view for outputting a form-size-informationimage after inputting a formed edge-information image representingtexture.

FIG. 48 is an explanation view for normalizing a segmented object areain a digital image.

FIG. 49 is a flow chart appearing an algorithm of an area normalizationmeans in this enforcement form.

FIG. 50 is a flow chart appearing an algorithm of an area normalizationmeans in this enforcement form, in a case of omitting complement betweenpixels.

FIG. 51 is an explanation view for generating a masked image from adigital image, using a segmented object-area image.

FIG. 52 is a flow chart appearing an algorithm of a mask means in thisenforcement form.

FIG. 53 is a flow chart appearing an algorithm of an image keeping meansin this enforcement form.

FIG. 54 is an explanation view for carrying out pattern matching of anormalized image with some template images.

FIG. 55 is a flow chart appearing an algorithm of a pattern matchingmeans in this enforcement form.

FIG. 56 is an explanation view for generating an object-area image froma formed edge-information image representing a triangle and aredundant-information image.

FIG. 57 is a flow chart appearing an algorithm of a figure/groundseparation means in this enforcement form.

FIG. 58 is an explanation view appearing a state where dashed triangularedge information separates an inside area of dashed triangle and anoutside area of dashed triangle.

FIG. 59 is an explanation view appearing a state where edge informationof two stacked triangles separates two triangle areas and a backgroundarea.

FIG. 60 is an explanation view appearing a state where dashed edgeinformation separates two circular areas and a background area, in acase that two circular object areas are overlapping.

FIG. 61 is a block diagram of internal architecture of an arrayoperation unit.

FIG. 62 is a block diagram of a controller.

FIG. 63 is an explanation view appearing some input and output signalsof a flag decoder.

FIG. 64 is an explanation view appearing some input and output signalsof a flag encoder.

FIG. 65 is a circuit diagram of a flag decoder and a flag encoder.

FIG. 66 is a block diagram of a flag encoder and a status register.

FIG. 67 is a circuit diagram of a flag encoder and a status registercommunicating with a right array operation unit.

FIG. 68 is an explanation view for an array operation unit whose fivecontrollers are arranged on a plane.

FIG. 69 is an explanation view for an array operation unit whose fivecontrollers are stacked.

FIG. 70 is an explanation view for regarding 16 array operation units asa virtual array operation unit.

FIG. 71 is an explanation view for giving three quota numbers forcontrollers to 16 array operation units included in a virtual arrayoperation unit, respectively.

FIG. 72 is an explanation view for a shift register memorizingsequentially 16 front input data outputted by 16 array operation units.

FIG. 73 is an explanation view for a transmit route, in a case that anarray operation unit transmits data counter-clockwisely to 120neighbors.

FIG. 74 is an explanation view for a transmit route, in a case that avirtual array operation unit identifying with an array operation unittransmits data counter-clockwisely to 120 neighbors.

FIG. 75 is an explanation view for a principle transmit route, in a casethat a virtual array operation unit including 4×4 array operation unitstransmits data counter-clockwisely to 120 neighbors.

FIG. 76 is an explanation view for a real transmit route, in a case thata virtual array operation unit including 4×4 array operation unitstransmits data counter-clockwisely to 120 neighbors.

FIG. 77 is an explanation view for wiring, in a case that each of fourcontrollers in an array operation unit sends data to a controller in anupper array operation unit, whose assigned number is one smaller than anumber of the controller.

FIG. 78 is an explanation view for wiring, in a case that each of fourcontrollers in an array operation unit sends data to a controller in alower array operation unit, whose assigned number is one bigger than anumber of the controller.

FIG. 79 is an explanation view for wiring, in a case that each of fourcontrollers in an array operation unit sends data to a controller in aleft array operation unit, whose assigned number is one bigger than anumber of the controller.

FIG. 80 is an explanation view for wiring, in a case that each of fourcontrollers in an array operation unit sends data to a controller in aright array operation unit, whose assigned number is one smaller than anumber of the controller.

FIG. 81 is an explanation view for wiring, in a case that each of fourcontrollers arranged vertically in an array operation unit sends data toa controller in an upper array operation unit, whose assigned number isone smaller than a number of the controller.

FIG. 82 is an explanation view for a transmit route in upper-rightdirection, in a case that an array operation unit comprising controllersfor transmit transmits data counter-clockwisely.

FIG. 83 is an explanation view for a transmit route in upper-rightdirection, in a case that an array operation unit comprising controllersfor transmit and retransmit transmits data counter-clockwisely.

FIG. 84 is an explanation view for a controller comprising four transmitcircuits.

FIG. 85 is an explanation view for assignment of each bit in acommunication status buffer.

FIG. 86 is an explanation view for a front input circuit inputting 16front input data.

FIG. 87 is a state transition diagram of a controller for a front inputcircuit.

FIG. 88 is an explanation view for a result output circuit outputting 16result data.

FIG. 89 is a state transition diagram of a controller for a resultoutput circuit.

FIG. 90 is an explanation view for a transmit circuit communicating apositive-logical SEND and a positive-logical RECEIVE, and memorizing acalculation datum when the SEND is active.

FIG. 91 is a state transition diagram of a controller for a transmitcircuit communicating a positive-logical SEND and a positive-logicalRECEIVE.

FIG. 92 is an explanation view for a transmit circuit communicating anegative-logical SEND and a negative-logical RECEIVE, and memorizing acalculation datum when the SEND is active.

FIG. 93 is an explanation view for a transmit circuit communicating anegative-logical SEND and a negative-logical RECEIVE, and memorizing acalculation datum when the SEND rose.

FIG. 94 is an explanation view for assignment of each bit in acalculation status.

FIG. 95 is an explanation view for position of 4×4 array operation unitsincluded in a virtual array operation unit.

FIG. 96 is a circuit diagram of a basic interlocked counter.

FIG. 97 is a circuit diagram of a synchronous counter using threeflip-flops.

FIG. 98 is a circuit diagram of an interlocked counter in which asynchronous counter counts up to five.

FIG. 99 is a circuit diagram of a synchronous counter using an ICnumber, 74163.

FIG. 100 is a block diagram of a network consisting of three interlockedcounters.

FIG. 101 is a timing chart in a case that three interlocked counterssynchronize.

FIG. 102 is a timing chart in a case that a phase of one of threeinterlocked counters progresses.

FIG. 103 is a timing chart in a case that a phase of one of threeinterlocked counters is overdue.

FIG. 104 is a timing chart in a case that three phases of threeinterlocked counters are different each other.

FIG. 105 is a circuit diagram of an interlocked counter comprising asynchronous oscillator.

FIG. 106 is a circuit diagram of an interlocked counter comprising asynchronous oscillator, in which a synchronous counter counts up tofive.

FIG. 107 is a circuit diagram of a synchronous oscillator, in a case ofusing a ring oscillator.

FIG. 108 is a timing chart of FIG. 107.

FIG. 109 is a circuit diagram of a synchronous oscillator, in a case ofusing a ring oscillator consisting of CMOS gates.

FIG. 110 is a circuit diagram of a synchronous oscillator, in a case ofusing an astable multi-vibrator consisting of TTL gates.

FIG. 111 is a circuit diagram of a synchronous oscillator, in a case ofusing a loop filter and a voltage controlled oscillator.

FIG. 112 is a timing chart of FIG. 111.

FIG. 113 is a block diagram of a network consisting of some interlockedcounters arranged in the shape of a square lattice.

FIG. 114 is a block diagram of a network consisting of some interlockedcounters arranged in the shape of a hexagonal lattice.

FIG. 115 is a block diagram of a network consisting of some interlockedcounters arranged as distance between them is equal.

FIG. 116 is an explanation view for stacking interlocked counters astheir lattices are overlapping.

FIG. 117 is an explanation view for stacking interlocked counters,digital circuits and analog circuits.

FIG. 118 is a circuit diagram of an interlocked signal distributioncircuit generating an output signal, using third and fifth outputs of adecoder for signal distribution, in a case that a latch circuit forsignal distribution is reset by an output of a flip-flop circuit forsignal distribution.

FIG. 119 is a timing chart of an interlocked signal distribution circuitgenerating an output signal, using third and fifth outputs of a decoderfor signal distribution.

FIG. 120 is a circuit diagram of an interlocked signal distributioncircuit generating an output signal, using third and fifth outputs of adecoder for signal distribution, in a case that a latch circuit forsignal distribution is reset by an output of the decoder for signaldistribution.

FIG. 121 is an explanation view for outputting pixel signals in parallelby sensor modules arranged in the shape of a lattice.

FIG. 122 is an explanation view for outputting pixel signals in parallelby sensor modules arranged in the shape of a hexagonal lattice.

FIG. 123 is an explanation view for a pixel cell consisting of aphoto-receptor element and a charge transfer gate.

FIG. 124 is an explanation view for a case that a sensor module picks upa pixel signal in order from pixel cells arranged in the shape of alattice, by using a charge coupled device arranged sigmoidly and a drivedevice for charge transfer.

FIG. 125 is an explanation view for a case that a sensor module picks upa pixel signal in order from pixel cells arranged in the shape of alattice, by using a charge coupled device arranged in the shape of aspiral and a drive device for charge transfer.

FIG. 126 is an explanation view for a case that a sensor module picks upa pixel signal in order from pixel cells arranged in the shape of ahexagonal lattice, by using a charge coupled device arranged in theshape of a spiral.

FIG. 127 is an explanation view for a pixel cell consisting of aphoto-receptor element, a charge amplifier and a column selection gate.

FIG. 128 is an explanation view for a case that a sensor module picks upa pixel signal in order from pixel cells arranged in the shape of alattice, by using a vertical shift register and a horizontal shiftregister.

FIG. 129 is an explanation view for a case that each of sensor modulesarranged in the shape of a lattice receives light from an upper side andoutputs a pixel signal toward a lower side.

FIG. 130 is an explanation view for a case that each of sensor modulesarranged in the shape of a hexagonal lattice receives light from anupper side and outputs a pixel signal toward a lower side.

FIG. 131 is an explanation view for stacking a layer wherephoto-receptor elements are implemented, a layer where a drive devicefor charge transfer, charge transfer gates and an output amplifier areimplemented, and a layer where a charge coupled device is implemented.

FIG. 132 is an explanation view for stacking a layer wherephoto-receptor elements are implemented, a layer where charge amplifiersare implemented, and a layer where a vertical shift register, ahorizontal shift register, column selection gates, noise cancellers, rowselection gates and an output amplifier are implemented.

FIG. 133 is an explanation view for stacking a layer where sensormodules are implemented, a layer where A/D converters are implemented,and a layer where digital circuits are implemented.

FIG. 134 is a block diagram of a digital circuit comprising a processor,a set of memories and a controller.

FIG. 135 is a block diagram of a controller, in which a front inputshift register inputs pixel data in order, a front input data registerremains the pixel data, and an address decoder selects the pixel data.

FIG. 136 is an explanation view for a case that light is applied to animage sensor comprising a digital circuit from a light source.

FIG. 137 is a flow chart of a memory rewriting routine in order torewriting a memory datum in a set of memories, during a processorobserves a controller.

FIG. 138 is a flow chart of a memory rewriting routine in order torewriting a memory datum in a set of memories, when a processor inputteda memory rewriting signal.

FIG. 139 is an explanation view for nine pixel data stored in a set ofmemories, in a case that zero or three among 3×3 photo-receptor elementsreceive light.

FIG. 140 is an explanation view for nine pixel data stored in a set ofmemories, in a case that six or nine among 3×3 photo-receptor elementsreceive light.

FIG. 141 is an explanation view for applying interference fringes to animage sensor, by using a transparent grating.

FIG. 142 is an explanation view for applying interference fringes to animage sensor, by using a reflecting grating.

FIG. 143 is an explanation view for applying interference fringes to animage sensor, by using a grating formed in an optical waveguide.

DETAILED DESCRIPTION

Some enforcement forms of a visual device 2 are shown below. Withreference to the drawings, then, it is explained about the enforcementforms.

First, as shown in FIG. 1, an enforcement form of a visual device 2corresponding to the invention described in claim 1 detects position,size and form of at least one object from the object moving in digitalimages 111, by using an image memorization means 12, an edge-informationgeneration means 14, an edge-information formation means 15 and ageometrical analysis means 37. The image memorization means 12 memorizesthe digital images 111 in order. The edge-information generation means14 generates a rough edge-information image 113 including rough edgeinformation 112 of at least one object moving in the digital images 111,by using two digital images 111. The edge-information formation means 15forms the rough edge-information image 113 into a formededge-information image 115, by using one of two digital images 111. Thegeometrical analysis means 37 consists of a position/size/inclinationdetection means 44 and a position/size/form detection means 45 (refer toFIG. 45), and generates a form-size-information image 190 from theformed edge-information image 115. For all objects, even though thepresent invention does not know any information like position, size,inclination, form and color of the objects in the digital images 111beforehand, the present invention can detect the position, the size andthe form of the objects in the digital images 111. Therefore, eventhough a user of the present invention does not know any information onan object, which is a target of detection, beforehand, the user can usethe present invention easily.

As shown in FIG. 2, an enforcement form of a visual device 2corresponding to the invention described in claim 2 separates at leastone object area 141 representing at least one object moving in digitalimages 111 from a background area, by using two image memorization means12, an edge-information generation means 14, an edge-informationformation means 15, a position/size detection means 17 and afigure/ground separation means 16. One image memorization means 12memorizes the digital images 111 in order. The edge-informationgeneration means 14 generates a rough edge-information image 113including rough edge information 112 of at least one object moving inthe digital images 111, by using two digital images 111. Theedge-information formation means 15 forms the rough edge-informationimage 113 into a formed edge-information image 115, by using one of twodigital images 111. The position/size detection means 17 generates aredundant-information image 132 representing an approximate position ofa center of gravity and size of at least one object area 141 segmentedby the formed edge-information image 115. The figure/ground separationmeans 16 separates at least one object area 141 segmented by the formededge-information image 115, by using the redundant-information image132, and generates an object-area image 142. Another image memorizationmeans 12 memorizes the object-area image 142. For all objects, eventhough the present invention does not know any information likeposition, size, inclination, form and color of the objects in thedigital images 111 beforehand, the present invention can separate atleast one object area 141 from a background area. Therefore, even thougha user of the present invention does not know any information on anobject, which is a target of detection, beforehand, the user can use thepresent invention easily.

As shown in FIG. 3, a visual device 2 for recognizing color of an objectcarries out pattern matching for an object area 141 representing atleast one object moving in digital images 111, by adding a mask means 40and a pattern matching means 38 to the enforcement form of the visualdevice 2 corresponding to the invention described in claim 2. Since themask means 40 carries out filtering only a segmented object area 143 inthe digital image 111 memorized by one image memorization means 12,which corresponds to the object area 141 in the object-area image 142memorized by another image memorization means 12, the mask means 40generates a masked image 148. After the pattern matching means 38selects the most similar template image 146 with the masked image 148every pixel, by comparing the masked image 148 with template images 146,it outputs matching results of all pixels as a matching-result image147. The template images 146 are filled by a single color which isdifferent from each other. As a result, the pattern matching means 38selects a color of a whole of the segmented object area 143. Note thatthe pattern matching means 38 essentially must memorize the necessarynumber of template images 146 beforehand, according to a purpose. As adash line toward the pattern matching means 38 from the mask means 40 isshown in FIG. 3, however, the pattern matching means 38 can alsoincrease the number of the template images 146, by inputting a maskedimage 148 outputted from the mask means 40 as a template image 146. Forall objects, even though the present invention does not know anyinformation like position, size, inclination, form and color of theobjects in the digital images 111 beforehand, the present invention canselect a color of an object represented by at least one segmented objectarea 143 in the digital images 111 from colors represented by thetemplate images 111. Therefore, even though a user of the presentinvention does not know any information on an object, which is a targetof detection, beforehand, the user can use the present invention easily.

As shown in FIG. 4, a visual device 2 for recognizing a pattern carriesout pattern matching for an object area 141 representing at least oneobject moving in digital images 111, by adding at least one combinationof an edge-information formation means 15, a geometrical analysis means37, an area normalization means 27 and a pattern matching means 38 tothe enforcement form of the visual device 2 corresponding to theinvention described in claim 2. In each of all combinations, the objectarea image 142 and the digital images 111 are processed as follow:First, the edge-information formation means 15 regards the object areaimage 142 memorized by one image memorization means 15 as a roughedge-information image 113, and forms the rough edge-information image113 into a formed edge-information image 115, by using a segmentedobject image 143 corresponding to the object area 141 in the digitalimage 111 memorized by another image memorization means 12. Here, edgeinformation 114 constructing each pixel of the formed edge-informationimage 115 represents an approximate pattern or a fine texture of thesegmented object area 143, by size and image quality of the segmentedobject area 143. Next, the geometrical analysis means 37 analyzes thepattern or the texture of the segmented object area 143 by the formededge-information image 115, and generates a form-size-information image190. Next, the area normalization means 27 normalizes theform-size-information image 190 by the object area image 142, andgenerates a normalized image 145. Here, since the area normalizationmeans 27 does not have to complement between pixels of the normalizedimage 145, division by a natural number is omitted. Finally, after thepattern matching means 38 selected the most similar template image 146with the normalized image 145 every pixel, by comparing the normalizedimage 145 with the template images 146, it outputs matching results ofall pixels as a matching-result image 147. Since the template images 146are generated from different objects, respectively, the pattern matchingmeans 38 selects an object representing the segmented object area 143.However, template images 146 generated from some similar objects arealso similar each other. As a result, the pattern matching means 38selects type of object common with some objects represented by thesegmented object areas 143. Note that the pattern matching means 38essentially must memorize the necessary number of template images 146beforehand, according to a purpose. As a dash line toward the patternmatching means 38 from the mask means 40 is shown in FIG. 3, however,the pattern matching means 38 can also increase the number of thetemplate images 146, by inputting a masked image 148 outputted from themask means 40 as a template image 146. For all objects, even though thepresent invention does not know any information like position, size,inclination, form and color of the objects in the digital images 111beforehand, the present invention can select type of an objectrepresented by at least one segmented object area 143 in the digitalimages 111 from objects represented by the template images 111.Therefore, even though a user of the present invention does not know anyinformation on an object, which is a target of detection, beforehand,the user can use the present invention easily.

Note that any combinations of some means shown in FIG. 3 and FIG. 4 arealso a variation of the visual device 2.

Besides this, as shown in FIG. 5, a visual device 2 can detect position,size and inclination of an object area 141 by generating aninclination-size-information image 186 from at least one object area 141memorized by an image memorization means 12, using aposition/size/inclination detection means 44.

As shown in FIG. 6, then, a visual device 2 for recognizing an objectarea 141 is a combination of the visual device 2 for recognizing apattern, the position/size/inclination detection means 44 shown in FIG.5, some image recognition means 29 and an environmental understandingmeans 31, where the visual device 2 for recognizing the pattern is acombination of some means shown in FIG. 3 and FIG. 4. Each of the imagerecognition means 29 derives a recognition result for an image inputtedby a pattern matching means 38 from unifying the matching resultsmatched with template images 146, which are represented by each pixel ofa matching-result image 147 inputted from the corresponding patternmatching means 38. Note that a neural network like a Perceptron learningby a back propagation method and so on can be also used as a methodunifying the matching results, but it is generally enough for the methodto select merely the most matching result in the matching-result image147, like a majority rule. The environmental understanding means 31decides position, size, form, texture, color and inclination of anobject area 141, by using these matching results and aninclination-size-information image 186 inputted from theposition/size/inclination detection means 44, followed by generating anenvironmental datum consisting of these information. Moreover, theenvironmental understanding means 31 outputs an environmental map whichis a list of these environmental data, by memorizing the environmentaldata of all objects in the digital images 111. For all objects, eventhough the present invention does not know any information likeposition, size, inclination, form, color of the objects in the digitalimages 111 beforehand, the present invention can make an environmentalmap for an object represented by at least one segmented object area 143in the digital images 111. Therefore, even though a user of the presentinvention does not know any information on an object, which is a targetof detection, beforehand, the user can use the present invention easily.

As shown in FIG. 7, a visual device 2 for understanding an imagecomprises the geometrical analysis means 37 shown in the enforcementform of the visual device 2 corresponding to the invention described inclaim 1, in addition to all means shown in the visual device 2 forrecognizing an object area 141. Since the geometrical analysis means 37is added, the environmental understanding means 31 can discriminate someobjects easily even though there are the objects in the digital image111. In addition, even though the figure/ground separation means 16separates an object area 141 and a background area incompletely, theenvironmental understanding means 31 can generate a suitableenvironmental datum for an object detected by the geometrical analysismeans 37 because it compares position and size of the object withposition and size of an object area 141 detected by theposition/size/inclination detection means 44, and moreover, it comparescontours of the object detected by the geometrical analysis means 37with type and color of objects represented by object areas 141 decidedby some image recognition means 29. For all objects, even though thepresent invention does not know any information like position, size,inclination, form, color of the objects in the digital images 111beforehand, the present invention can make an environmental map for allobjects in the digital images 111. Therefore, even though a user of thepresent invention does not know any information on an object, which is atarget of detection, beforehand, the user can use the present inventioneasily.

As shown in FIG. 8, a visual device 2 for searching an object comprisesan image capturing means 11, a camera/environmental coordinateconversion means 20, two image/environmental coordinate conversion means21, a timer means 32, an object position inference means 34, a vibrationcommand generation means 25, an action control means 23 and a cameracommand generation means 26, in addition to all means shown in thevisual device 2 for recognizing an object area 141. The image capturingmeans 11 converts each of frame images constructing an animation imagetaken by a moving camera 10 into a digital image 111 in order. If theframe image consists of analog signals, the image capturing means 11converts the frame image into digital signals, and generates the digitalimage 111. On the other hand, in a case that the frame image consists ofdigital signals, the image capturing means 11 expands the frame imageand generates the digital image 111 if the digital signals arecompressed. Otherwise, the image capturing means 11 converts the frameimage into the digital image 111 directly.

By the way, in a case that a moving camera 10 carries out at least oneof pan, tilt, roll and zoom, digital images 111 do not always appear thesame place with the same magnification and the same inclination becausedirection, inclination and magnification of the moving camera 10 arealso changed. Therefore, position, size and inclination of an objectdetected by the geometrical analysis means 37 and theposition/size/inclination detection means 44 may be changed everydigital image 111. In order for the moving camera 10 to take the imageof the object, whose size in the image is always suitable, the visualdevice 2 uses three coordinate systems; a camera coordinate system, animage coordinate system and an environmental coordinate system,corresponding to its functions. First, the camera coordinate system is athree-dimensional spherical coordinate system used by the moving camera10, in order for the moving camera 10 to control pan, tilt and zoom in aminimum control unit, respectively. In general, the origin of the cameracoordinate system is a primitive position of the moving camera 10,called a home position. The camera coordinate system is only acoordinate system possible to appear physical positions of the objects,but the camera coordinate system can not be used for general purposebecause each model of the moving camera 10 has its own camera coordinatesystem. Therefore, the visual system 2 has to keep the camera coordinatesystem secret against other means. Second, the image coordinate systemis a two-dimensional coordinate system whose unit is a pixel, and whoseorigin is the center of a frame image taken by the moving camera 10,that is, a light axis of lens. This system is used to appear some pixelsof the frame image, at which the objects are. The image coordinatesystem is suitable for distinguishing positions of some objects in theframe image finely, but the physical positions of the objects can not beappeared by only the image coordinate system. Third, the environmentalcoordinate system is a three-dimensional spherical coordinate systemused in order for the visual device 2 to appear consistently internalpositions of the objects. The angle for horizontal and verticaldirections is represented by radian. Distance in the environmentalcoordinate system is represented by real numbers, whose unit is 1.0, inorder to appear the product of the size of objects and the distance tothem. Since the size of the objects do not change extremely for a shorttime, in general, we can assume that the distance to the objects isproportional to the magnification of the moving camera 10. The origin ofthe environmental coordinate system can be defined freely. In short, theenvironmental coordinate system is used to appear the relativecoordinate of any two points on the environmental system itself. Thevisual device 2 can distinguish some objects in environment, byprojecting them possible to be taken by the moving camera 10 to theenvironmental coordinate system.

Here, the camera coordinate system and the image coordinate system mustbe converted themselves each other. Means playing such a role are acamera/environmental coordinate conversion means 20, animage/environmental coordinate conversion means 21 and an action controlmeans 23. These means derive two units of the camera coordinate systemand the image coordinate system, corresponding to the specification ofthe moving camera 10 and the image capturing means 11, and then computea matrix for converting from them to the environmental coordinatesystem. A convert matrix from the environmental coordinate system to thecamera coordinate system is also derived by computing an invert matrixof the convert matrix from the camera coordinate system to theenvironmental coordinate system. Note that a position of theenvironmental coordinate system converted from the camera coordinatesystem is equal to a relative position from the home position of themoving camera 10, which is on the environmental coordinate systembecause the origin of the camera coordinate system is the home positionof the moving camera 10. On the other hand, the position of the cameracoordinate system converted from the environmental coordinate system isequal to a relative position from the present position of the movingcamera 10, which is on the camera coordinate system. In addition, theposition is not converted to the environmental coordinate system byusing only the image coordinate system because the image coordinatesystem is the two-dimensional coordinate system. The position of theimage coordinate system can be converted to the environmental coordinatesystem, when the image/environmental coordinate conversion means 21computes the convert matrix frequently, using the direction and themagnification of the moving camera 10 represented by the environmentalcoordinate system and the size of areas of the objects in the frameimage. Note that a position of the environmental coordinate systemconverted from the image coordinate system is equal to a relativeposition from the center of the image.

By the way, in a case that the moving camera 10 leaned, the visualdevice 2 can not derive a position on the environmental coordinatesystem as described above. For example, as shown in FIG. 9, suppose thatthere is formed edge information 114 of an object which leaned at anangle θ counter-clockwisely, at a position α in a formededge-information image 115. If the moving camera 10 is rotated at theangle θ counter-clockwisely, centering on a center o of the formededge-information image 115, an edge-information formation means 15 canoutput a post-rotation formed edge-information image 181. In short,since the object stands straight at the point α in the post-rotationformed edge-information image 181, recognition of type of the objectcomes to be easy. However, a coordinate in the image coordinate systemderived from the position α in the post-rotation formed edge-informationimage 181 is a position rotating clockwisely at the angle θ to acoordinate in the image coordinate system which is derived from theposition α in the formed edge-information image 115. Therefore, thebigger the angle θ is, or the longer the distance oα is, the bigger agap between both coordinates comes to be. Thus, in order to derive thecoordinate in the image coordinate system before rotating from theposition α in the post-rotation formed edge-information image 181, weonly have better derive a position β, to which the position α in thepost-rotation formed edge-information image 181 is rotatedcounter-clockwisely at the angle θ. Note that a unit of inclination ofthe moving camera 10 and the angle θ are radian.

In the post-rotation formed edge-information image 181, now, let animage coordinate of the position α be (α_(x), α_(y)), and let an imagecoordinate of the position β be (β_(x), β_(y)). (α_(x), α_(y)) and(β_(x), β_(y)) can be derived according to EQ.1. $\begin{matrix}{\begin{bmatrix}\beta_{x} \\\beta_{y}\end{bmatrix} = {\begin{bmatrix}{\cos\quad\theta} & {{- \sin}\quad\theta} \\{\sin\quad\theta} & {\cos\quad\theta}\end{bmatrix}\begin{bmatrix}\alpha_{x} \\\alpha_{y}\end{bmatrix}}} & (1)\end{matrix}$

By this equation, the position β in the post-rotation formededge-information image 181, that is, the position α in the formededge-information image 115 can be derived from the position α in thepost-rotation formed edge-information image 181. As a result, theimage/environmental coordinate conversion means 21 can derive anenvironmental coordinate exactly from the position α in thepost-rotation formed edge-information image 181.

Considering the above, in the visual device 2 for searching an object, acamera/environmental coordinate conversion means 20 converts directionand magnification of the moving camera 10 into a position of theenvironmental coordinate system which is not related with physicalmeasure. Note that inclination of the moving camera 10 is converted intoan angle represented by a unit of radian. In addition, twoimage/environmental conversion means 21 project each pixel in aninclination-size-information image 186 and each pixel in aform-size-information image 190 to positions of the environmentalcoordinate system, respectively. Therefore, the environmentalunderstanding means 31 can generate an environmental map which is a listof environmental data represented by the environmental coordinatesystem. Moreover, the environmental understanding means 31 inputs acurrent time from a timer means 32, where a unit of the current time isless than or equal to one second, generally one millisecond. Therefore,since the environmental understanding means 31 can add a time stamp toeach of the environmental data included in the environmental map, theenvironmental understanding means 31 can represent an orbit of an objectand remove old environmental data. Note that the environmentalunderstanding means 31 can convert current direction, magnification andinclination of a moving camera 10 into an environmental datum, byinputting the current direction, the magnification and the inclinationof the moving camera 10 from the camera/environmental coordinateconversion means 20. The environmental datum is useful when an externalsystem uses the environmental map. The object position inference means34 selects one of at least one object represented by the environmentalmap, and presumes a current position and inclination of the object fromthe orbit of the object. The current position is also represented by theenvironmental coordinate system. The vibration command generation means25 generates a command for vibrating the moving camera 10. Therefore,since digital images 111 also vibrate in order, the edge-informationgeneration means 14 can regard an object which is still in an animationimage as it is moving. In short, the edge-information generation means14 can generate rough edge information 112 for the object. Note that, ina case that the object vibrates within about two or three pixels in thedigital images 111, the edge-information generation means 14 cangenerate the rough edge information 112 from only the objecteffectively. In a case that the action control means 23 inputs a currentposition and inclination of an object from the object position inferencemeans 34 or a command for vibrating the moving camera 10 from thevibration command generation means 25, the action control means 23decides destination of the moving camera 10 and converts it into thecamera coordinate system. The camera command generation means 26generates a command for controlling at least one of pan, tilt, roll andzoom of the moving camera 10 after inputting the destination. For allobjects, even though the present invention does not know any informationlike position, size, inclination, form and color of the objects in thedigital images 111 beforehand, the present invention can search allobjects in the digital images 111. Therefore, even though a user of thepresent invention does not know any information on an object, which is atarget of detection, beforehand, the user can use the present inventioneasily.

Besides this, for example, as shown in FIG. 10, a visual device 2 forcounting the number of objects also comprises two image keeping means39, two or more recognition-result keeping means 30, anenvironmental-map keeping means 33, an object counting means 35 and anobject number keeping means 36, which are for outputting informationgenerated by the visual device 2, a color-information generation means41, two position/size detection means 17, two image/environmentalcoordinate conversion means 21 and two position selection means 22,which are for searching the objects efficiently, and a control commandinput means 24 for controlling the visual device 2 from an externalpart, in addition to all means shown in the visual device 2 forsearching the objects.

First, until a system in the external part finishes inputting a digitalimage 111 memorized by one image memorization means 12, one imagekeeping means 39 keeps the digital image 111 for a specific period.Until the system in the external part finishes inputting an object areaimage 142 memorized by another image memorization means 12, anotherimage keeping means 39 keeps the object area image 142 for a specificperiod. By combining these two images, the system in the external partcan cut off an area corresponding to an object area 141 from the digitalimage 111. Until the system in the external part finishes inputtingrecognition results of pattern, texture and color for a segmented objectarea 143 decided by two or more image recognition means 29, thecorresponding recognition-result keeping means 30 keeps the recognitionresults for a specific period, respectively. Note that at least onerecognition-result keeping means 30 may output a recognition result ofpattern and a recognition result of texture, mixing them. Until thesystem in the external part finishes inputting an environmental mapgenerated by the environmental understanding means 31, theenvironmental-map keeping means 33 keeps the environmental map for aspecific period. The object counting means 35 counts the number ofobjects detected from the environmental map within a specific period,and outputs the number of the objects. Until the system in the externalpart finishes inputting the number of the objects, the object numberkeeping means 36 keeps the number of the objects for a specific period.

Next, the color-information generation means 41 selects pixelsrepresenting a specific color like red, yellow and white from each pixelof the digital image 111, and generates a color-information image 172.The color-information image 172 is seldom useful for a case ofrecognizing objects in a real world, in which brightness always changesand innumerable colors overflow, but it is much useful for a case ofsearching quickly an object, to which an attention must be paid or whichmay give danger, like blood, fire, a signal, a road sign, light of aheadlight and so on. One position/size detection means 17 detectsposition and size of at least one object, to which an attention must bepaid, from the color-information image 172, and generates aredundant-information image 132. One image/environmental coordinateconversion means 21 projects redundant information 131 constructing eachpixel of the redundant-information image 132 to the environmentalcoordinate system. One position selection means 22 selects one from allredundant information 131. On the other hand, another position/sizedetection means 17 detects position and size of at least one movingobject from a rough edge-information image 113, and generates aredundant-information image 132. Another image/environmental coordinateconversion means 21 projects redundant information 131 constructing eachpixel of the redundant-information image 132 to the environmentalcoordinate system. Another position selection means 22 selects one fromall redundant information 131. In addition, the control command inputmeans 24 inputs a control command directed by a user or a suitablesystem from an external part. Then, the action control means 23 selectsone from objects around the moving camera 10 and objects directed by theuser and the system, besides objects represented by the environmentalmap, followed by sending an environmental coordinate of a selectedobject to the camera command generation means 26.

For all objects, therefore, even though the present invention does notknow any information like position, size, inclination, form and color ofthe objects in the digital images 111 beforehand, the present inventioncan search all objects in the digital images 111, and count the numberof the objects. Thus, even though a user of the present invention doesnot know any information on an object, which is a target of detection,beforehand, the user can use the present invention easily. Note that theuser can select only desired means from FIG. 10, in using the presentinvention really. Moreover, he can append other means to the presentinvention.

Now, the image memorization means 12, the color-information generationmeans 41, the edge-information generation means 14, the edge-informationformation means 15, the position/size detection means 17, theposition/size/inclination detection means 44, the geometrical analysismeans 37, the figure/ground separation means 16, the area normalizationmeans 27, the mask means 40, the image keeping means 39 and the patternmatching means 38 used in the visual devices 2 can be implemented byusing a data processing device 110 consisting of some array operationunits 100. Some enforcement forms of the data processing device 110consisting of the array operation units 100 are shown below. Withreference to the drawings, then, it is explained about the visual device2.

First, an array operation unit 100 generates a pixel in an output image,by using a pixel and its neighbor pixels in an input image. As shown inFIG. 11, a data processing device 110 can generate the output image fromthe input image, when some array operation units 100 are arranged in theshape of a lattice in the data processing device 110, according to sizeof the input image. Note that the array operation unit 100 is denoted asAOU in FIG. 11. In addition, the array operation units 100 are arrangedin the shape of a square lattice in FIG. 11. Of course, however, theymay be arranged in the shape of a hexagonal lattice, that is, hexagonalclosest packing, in order to make an implementation surface smallest. Inthis case, a part of signal lines between the array operation units 100are wired zigzag. Next, the array operation unit 100 may be implementedby a specialized hardware. Otherwise, it can be also implemented by asoftware on a general computer. That is, if the data processing device110 can generate the output image from the input image, theimplementation way of the array operation unit 100 is not limited. Imageprocessing of the data processing device 110 can be appeared bydescribing some algorithms of the array operation unit 100. In order todescribe the algorithms of the array operation unit 100, it is explainedhere about some equations used in the image memorization means 12, thecolor-information generation means 41, the edge-information generationmeans 14, the edge-information formation means 15, the position/sizedetection means 17, the position/size/inclination detection means 44,the geometrical analysis means 37, the area normalization means 27, themask means 40, the image keeping means 39 and the pattern matching means38 shown in FIG. 10.

Suppose that any three 2^(n)-tone images are denoted as x, y and w,where their width is w, their height is h, their band number is b. Thex, y and w are represented as EQ.2, EQ.3 and EQ.4, using threeband-pixel values x_(ijk), y_(ijk) and w_(ijk) at a position p(i, j, k),respectively. Note that bold letters means vectors, n is thenon-negative number, and w, h, b, i, j and k are the natural number.x={x _(ijk) |x _(ijk) is value at p(i,j,k), 1≦i≦w, 1≦j≦h, 1≦k≦b}  (2)y={y _(ijk) |y _(ijk) is value at p(i,j,k), 1≦i≦w, 1≦j≦h, 1≦k≦b}  (3)w={w _(ijk) |w _(ijk) is value at p(i,j,k), 1≦i≦w, 1≦j≦h, 1≦k≦b}  (4)

First, it is described here about functions on point processing for eachband-pixel value in the above images.

When an image x is converted to a binary image, EQ.5 makes a band-pixelvalue of x binary. $\begin{matrix}{{\Phi_{ijk}(x)} = \left\{ \begin{matrix}1 & {{{{if}\quad x_{ijk}} > 0},} \\0 & {{otherwise}.}\end{matrix} \right.} & (5)\end{matrix}$

When an image x is converted to a band maximum-value image, EQ.6 selectsa maximum value of all band values of pixel at column i and row j. Notethat the number of bands of the above band maximum-value image is dealtwith one, for convenience' sake, because the above band maximum-valueimage becomes a one-band image. The third index of function B_(ij1)(x)is then equal to one. $\begin{matrix}{{B_{{ij}\quad 1}(x)} = {\max\limits_{k}\left\{ x_{ijk} \right\}}} & (6)\end{matrix}$

Suppose that an image x is a binary image. When the image x is inverted,EQ.7 calculated inversion.I _(ijk)(x)=1−x _(ijk)  (7)

EQ.8 converts a value at a position p(i, j, k) of an image x to alogarithm of the value. Note that e is an offset value, and there is noproblem for e=1 in general because this value is used in order for avalue outputted by a natural logarithmic function to be within a validrange. Subtraction between two band-pixel values can supersede divisionbetween them by this conversion. Suppose also that the image x is a2^(n)-tone digital image 111. If a memory 102 has a look-up tableincluding 2^(n) elements in spite of the number of bands, a naturallogarithm function does not have to be calculated every time, and thememory 102 also does not have to memorize a standard table oflogarithms.L _(ijk)(x)=ln(x _(ijk) +e)  (8)

Now, a set P_(ijk) (q) of neighbor positions around a position p(i, j,k) in an image is represented by EQ.9, where q is a progression of 4, 8,24, 48, 80, 120, (2r+1)²−1, and r is a natural number. When a positionoutside of the image is included in the set P_(ijk)(q), it is supersededby the position p(i, j, k) as long as there is especially nospecification. Otherwise, the position is superseded by a fictitiousposition, a pixel value at which is equivalent to zero, and which is notincluded by the image. Processing around borders is automaticallycarried out by this replacement. Then, the number of elements, N_(ijk),of the set P_(ijk)(q) is always q. $\begin{matrix}{{P_{ijk}(q)} = \left\{ \begin{matrix}\begin{matrix}\left\{ {{p\left( {{i + 1},j,k} \right)},{p\left( {i,{j + 1},k} \right)},} \right. \\\left. {{p\left( {{i - 1},j,k} \right)},{p\left( {i,{j - 1},k} \right)}} \right\}\end{matrix} & {{{{if}\quad q} = 4},} \\\begin{matrix}\left\{ {{{p\left( {l,m,k} \right)}❘{{i - r} \leq l \leq {i + r}}},{{j - r} \leq}} \right. \\\left. {{m \leq {j + r}},{{p\left( {l,m,k} \right)} \neq {p\left( {i,j,k} \right)}}} \right\}\end{matrix} & {{{if}\quad q} = {\left( {{2r} + 1} \right)^{2} - 1.}}\end{matrix} \right.} & (9)\end{matrix}$

Next, it is explained here about some functions and an operator for eachband-pixel value on neighbor processing, whose neighbors are included ineight neighbors 182.

Smoothing at a position p(i, j, k) of an image x is carried outaccording to EQ.10, where int(v) represents omission below decimal pointfor any real number v. Let us consider a case that this equation isimplemented by a hardware. If a band-pixel value of the image x is aninteger, a division circuit is reduced by changing a general arithmeticcircuit as to perform a right-shift command two times in calculatingsummation of x_(lmk) if N_(ijk)=4, or three times in calculatingsummation of x_(lmk) if N_(ijk)=8. $\begin{matrix}{{S_{ijk}(x)} = {{int}\left( {\frac{1}{N_{ijk}}{\sum\limits_{{p{({l,m,k})}} \in {P_{ijk}{(q)}}}\quad x_{lmk}}} \right)}} & (10)\end{matrix}$

As shown in EQ.11, a Laplacian operator is just a second differentialoperator. Since a Laplacian operator for eight neighbors can catch adelicate change of noise, it makes many zero-points and zero-crossing.Therefore, the Laplacian operator for eight neighbors 182 is suitablefor the present invention. Let us consider a case that this equation isimplemented by a hardware. Since N_(ijk) is either four or eight, amultiple circuit is reduced by changing a general arithmetic circuit asto perform a left-shift command two times in calculating summation ofx_(lmk) if N_(ijk)=4, or three times in calculating summation of x_(lmk)if N_(ijk)=8. $\begin{matrix}{{\nabla_{ijk}^{2}x} = {\sum\limits_{{p{({l,m,k})}} \in {P_{ijk}{(q)}}}x_{{lmk}\quad - {N_{ijk}x_{ijk}}}}} & (11)\end{matrix}$

The way deriving a zero-point from a value calculated by a Laplacianoperator has found a pixel value varying from positive to negative.According to EQ.12, however, the present invention finds a pixel valuewhich shows zero-crossing from negative to positive, which goes via zerosuch as from negative to zero and from zero to positive, or whichremains zero. In the present invention, a zero-point found by EQ.12 doesnot suggest a place where edge exists, but represents a place wherenoise happens, that is, where edge does not exist. EQ.12 also makes realnumber binary. $\begin{matrix}{{Z_{ijk}(x)} = \left\{ \begin{matrix}1 & \begin{matrix}{{{{if}\quad x_{ijk}} \leq {0\quad{and}\quad x_{lmk}} \geq 0}\quad} \\{{{{{for}\quad}^{3}{p\left( {l,m,k} \right)}} \in {P_{ijk}(q)}},}\end{matrix} \\0 & {{otherwise}.}\end{matrix} \right.} & (12)\end{matrix}$

Suppose that an image x is any binary image. To fill a pixel with a holein the image x is carried out according to EQ.13, where a parameter frepresents size of the hole to fill, and there is no problem for f=1 ingeneral. Since this equation for four neighbors can not detect adiagonal line in nature, the equation has to use eight neighbors 182 asmuch as possible. $\begin{matrix}{{F_{ijk}(x)} = \left\{ \begin{matrix}1 & {{{{{if}\quad{\sum\limits_{{p{({l,m,k})}} \in {P_{ijk}{(q)}}}\quad x_{lmk}}} + f} \geq N_{ijk}},} \\x_{ijk} & {{otherwise}.}\end{matrix} \right.} & (13)\end{matrix}$

Suppose that an image x is any binary image. To delete a pixel which isan alone point or an alone hole in the image x is carried out accordingto EQ.14. Since this equation for four neighbors can not detect adiagonal line by nature, the equation has to use eight neighbors 182 asmuch as possible. $\begin{matrix}{{A_{ijk}(x)} = \left\{ \begin{matrix}0 & {{{{{if}\quad x_{ijk}} = {{1\quad{and}\quad{\sum\limits_{{p{({l,m,k})}} \in {P_{ijk}{(q)}}}x_{lmk}}} = 0}},}\quad} \\1 & {{{{{if}\quad x_{ijk}} = {{0\quad{and}\quad{\sum\limits_{{p{({l,m,k})}} \in {P_{ijk}{(q)}}}x_{lmk}}} = N_{ijk}}},}\quad} \\x_{ijk} & {{otherwise}.}\end{matrix} \right.} & (14)\end{matrix}$

Suppose that an image x is any binary image. In order to detect somelines whose width is equal to one in the image x, EQ.15 finds a pixelmaking the lines, using its four neighbors. $\begin{matrix}{{J_{ijk}(x)} = \left\{ \begin{matrix}x_{ijk} & {{{{{if}\quad x_{i - {1{jk}}}} + x_{i + {1{jk}}}} = {{{0\quad{or}\quad x_{{ij} - {1k}}} + x_{{ij} + {1k}}} = 0}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (15)\end{matrix}$

Suppose that two images, x and y, are binary images, where the image yconsists of pixels representing a line whose width is equal to one inthe image x. In order to expand the lines whose width is equal to one inthe image x, EQ.16 change a pixel, using its four neighbors.$\begin{matrix}{{K_{ijk}\left( {x,y} \right)} = \left\{ \begin{matrix}1 & {{{{{if}\quad y_{i - {1{jk}}}} + y_{i + {1{jk}}} + y_{{ij} - {1\quad k}} + y_{{ij} + {1\quad k}}} > 0},} \\x_{ijk} & {{otherwise}.}\end{matrix} \right.} & (16)\end{matrix}$

Complement of line width in a binary image can be simply described byEQ.17, using the detection of line width, EQ.15, and the expansion ofline width, EQ.16.C _(ijk)(x)=K _(ijk)(x,J(x))  (17)

Next, it is explained here about some functions and operators onneighbor processing for each band-pixel value of an image.

Suppose that there are two images, x and y. A maximum-value imagebetween them is derived by EQ.18. $\begin{matrix}{{M_{ijk}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{ijk} & {{{{if}\quad x_{ijk}} \geq y_{ijk}},} \\y_{ijk} & {{otherwise}.}\end{matrix} \right.} & (18)\end{matrix}$

Suppose that there are two images, x and y. A difference between them iscalculated by EQ.19.D _(ijk)(x,y)=x _(ijk) −y _(ijk)  (19)

Enhancement of a binary image can be simply described by EQ.20, usingthe Laplacian operator, EQ.11, and the difference, EQ.19.E _(ijk)(x)=D _(ijk)(x,∇ _(ijk) ² x)  (20)

Suppose that there are two images, x and y, where the image y is aone-band binary image. EQ.21 can mask each band-pixel value of the imagex by a band-pixel value of the image y.O _(ijk)(x,y)=x _(ijk) y _(ij1)  (21)

Suppose that there are two images, x and y, where they are both binary.The image y can be operated orthopedically according to EQ.22, based onthe image x. $\begin{matrix}{{Q_{ijk}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{ijk} & {{{{{if}\quad y_{ijk}} + {\sum\limits_{{p{({l,m,k})}} \in {P_{ijk}{(q)}}}y_{lmk}}} > 0},} \\0 & {{otherwise}.}\end{matrix} \right.} & (22)\end{matrix}$

Suppose that there are two images, x and y, where the image y is binary.A band-pixel value of the image x not directed by the image y iscomplemented by an average of some band-pixel values, which are directedby the image y, among neighbors of the band-pixel value of the image x,according to EQ.23, where int(v) represents omission below decimal pointfor any real number v. Note that a denominator of division in EQ.23 is apositive integer because the image y is binary. Thus, the division oftwo integers can be replaced with multiplication of two real numbers, interms of memorizing the reciprocals from one to q in a memory 102.$\begin{matrix}{{V_{ijk}\left( {x,y} \right)} = \left\{ \begin{matrix}{{int}\left( \frac{\sum\limits_{{p{({l,m,1})}} \in {P_{{ij}\quad 1}{(q)}}}{x_{lmk}y_{l\quad m\quad 1}}}{\sum\limits_{{p{({l,m,k})}} \in {P_{{ij}\quad 1}{(q)}}}y_{l\quad m\quad 1}} \right)} & {{{{if}\quad y_{{ij}\quad 1}} = {{0\quad{and}\quad{\sum\limits_{{p{({l,m,1})}} \in {P_{{ij}\quad 1}{(q)}}}y_{l\quad m\quad 1}}} > 0}},} \\x_{ijk} & {{otherwise}.}\end{matrix} \right.} & (23)\end{matrix}$

In the present invention, now, processing is carried out more simply byregarding positions of an image and transfer values as image data. Thisis called imagery of positions. It is described here about somefunctions and operators on imagery of positions.

Suppose first that an operator converting all values, l, m, o of aposition p(l, m, o) to a band-pixel value for an image datum is denotedas #, Moreover, suppose that the converted band-pixel value is denotedas #p(l, m, o). Let us consider a case that a band-pixel value istransferred from the position p(i, j, k) to the position p(i+l, j+m,k+o). A transfer value of the band-pixel value is represented by theposition p(l, m, o). In short, a transfer value is regarded as a vectorfrom some position. An operator taking out a position from a band-pixelvalue is denoted as #⁻¹, where #⁻¹#p(l, m, o)=p(l, m, o).

EQ.24 can change the direction of a transfer value p(i, j, k) to theopposite direction, that is, 180 degrees in a plane represented by widthand height.Y(p(i,j,k))=p(−i,−j,k)  (24)

Suppose that there is an image x, where the image x is binary. Atransfer value toward a center of gravity at a position p(i, j, 1) ofthe image x is calculated by EQ.25. By nature, division has to becarried out in calculating the center of gravity. However, the divisionis omitted in EQ.25 because the division is offset in converting thetransfer value to one of eight neighbors 182. $\begin{matrix}{{G_{{ij}\quad 1}(1)} = {p\left( {{\sum\limits_{{p{({l,m,1})}} \in {P_{{ij}\quad 1}{(q)}}}{\left( {l - i} \right)x_{l\quad m\quad 1}}},{\sum\limits_{{p{({l,m,1})}} \in {P_{{ij}\quad 1}{(q)}}}{\left( {m - j} \right)x_{l\quad m\quad 1}}},0} \right)}} & (25)\end{matrix}$

A pixel value of a transfer-value image can be made from a transfervalue p(i, j, k), by converting the p(i, j, k) to one of eight neighbors182, according to EQ.26, EQ.27 and EQ.28, where EQ.27 and EQ.28 is usedonly when an discrete image makes a trouble in EQ.26. $\begin{matrix}{{\Theta\left( {p\left( {i,j,k} \right)} \right)} = \left\{ \begin{matrix}{\#{p\left( {1,0,k} \right)}} & {{{{if}\quad i} > 0},{{j} < {{i}/2}},} \\{\#{p\left( {1,{- 1},k} \right)}} & {{{{if}\quad i} > 0},{j < 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,{- 1},k} \right)}} & {{{{if}\quad j} < 0},{{2{i}} < {j}},} \\{\#{p\left( {{- 1},{- 1},k} \right)}} & {{{{if}\quad i} < 0},{j < 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {{- 1},0,k} \right)}} & {{{{if}\quad i} < 0},{{j} < {{i}/2}},} \\{\#{p\left( {{- 1},1,k} \right)}} & {{{{if}\quad i} < 0},{j > 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,1,k} \right)}} & {{{{if}\quad j} > 0},{{2{i}} < {j}},} \\{\#{p\left( {1,1,k} \right)}} & {{{{if}\quad i} > 0},{j > 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,0,k} \right)}} & {{otherwise}.}\end{matrix} \right.} & (26) \\{{\Theta^{\prime}\left( {p\left( {i,j,k} \right)} \right)} = \left\{ \begin{matrix}{\#{p\left( {1,0,k} \right)}} & {{{{if}\quad i} > 0},{{j} < {{i}/2}},} \\{\#{p\left( {1,0,k} \right)}} & {{{{if}\quad i} > 0},{j < 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,1,k} \right)}} & {{{{if}\quad i} < 0},{j > 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,1,k} \right)}} & {{{{if}\quad j} > 0},{{2{i}} < {j}},} \\{\#{p\left( {1,1,k} \right)}} & {{{{if}\quad i} > 0},{j > 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,0,k} \right)}} & {{otherwise}.}\end{matrix} \right.} & (27) \\{{\Theta^{''}\left( {p\left( {i,j,k} \right)} \right)} = \left\{ \begin{matrix}{\#{p\left( {0,{- 1},k} \right)}} & {{{{if}\quad i} > 0},{j < 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,{- 1},k} \right)}} & {{{{if}\quad j} < 0},{{2{i}} < {j}},} \\{\#{p\left( {{- 1},{- 1},k} \right)}} & {{{{if}\quad i} < 0},{j < 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {{- 1},0,k} \right)}} & {{{{if}\quad i} < 0},{{j} < {{i}/2}},} \\{\#{p\left( {{- 1},0,k} \right)}} & {{{{if}\quad i} < 0},{j > 0},{{{i}/2} \leq {j} \leq {2{i}}},} \\{\#{p\left( {0,0,k} \right)}} & {{otherwise}.}\end{matrix} \right.} & (28)\end{matrix}$

By using EQ.25, EQ.26, EQ.27 and EQ.28, thus, the band-pixel value ofthe transfer-value image toward the center of gravity of the one-bandbinary image x can be simply described by EQ.29, EQ.30 and EQ.31. Notethat the number of bands of the transfer-value image is equal to one.Δ_(ij1)(x)=θ(G _(ij1)(x))  (29)Δ′_(ij1)(x)=Θ′(G _(ij1)(x))  (30)Δ′_(ij1)(x)=Θ′(G _(ij1)(x))  (31)

On the other hand, since the opposite position against the center ofgravity is derived by EQ.24, the band-pixel value of the transfer-valueimage against the center of gravity of the one-band binary image x canbe simply described by EQ.32. Note that the number of bands of thetransfer-value image is equal to one.R _(ij1)(x)=Θ(Y(G _(ij1)(x)))  (32)

Suppose that there are two images, x and y, where the image y is atransfer-value image. After a band-pixel value of the image x istransferred to a transfer position directed by the image y, according toEQ.33, a grayscale image can be made from summation of some band-pixelvalues which have been transferred to the same band-pixel.Γ_(ijk)(x,y)=Σx_(lmk) for p(l,m,1)εP _(ij1)(q) and #⁻¹ y _(lm1)=p(i−l,j−m,0).  (33)

In a case that each pixel of the one-band grayscale image x istransferred to one of neighbors toward the center of gravity, followedby calculating the summation of the band-pixel values transferred to thesame band-pixel, this process can be simply described by EQ.34 EQ.35 andEQ.36, using EQ.5, EQ.29, EQ.30, EQ.31 and EQ.33.Λ_(ij1)(x)=Γ_(ij1)(x,Δ(Φ(x)))  (34)Λ′_(ij1)(x)=Γ_(ij1)(x,Δ′(Φ(x)))  (35)Λ″_(ij1)(x)=Γ_(ij1)(x,Δ″(Φ(x)))  (36)

By the way, when the number of neighbors, q, in EQ.33 is limited toeight, the transfer-value image y can specify a transfer source amongeight neighbors 182 every pixel. In a case that the image x is aredundant-information image 132 and eight numbers from one to eight werearranged counter-clockwisely for eight neighbors 182 of each pixel in x,as shown in FIG. 12, eight equations from EQ.37 to EQ.44 can judgewhether there is redundant information 131 possible to transfer, foreach of eight transfer sources, respectively. $\begin{matrix}{{\Gamma_{{ij}\quad 1}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i + 1},j,1} & {{{{if}\quad\#^{- 1}y_{{i + 1},j,1}} = {p\left( {{- 1},0,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (37) \\{{\Gamma_{{ij}\quad 2}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i + 1},{j - 1},1} & {{{{if}\quad\#^{- 1}y_{{i + 1},{j - 1},1}} = {p\left( {{- 1},1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (38) \\{{\Gamma_{{ij}\quad 3}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{i,{j - 1},1} & {{{{if}\quad\#^{- 1}y_{i,{j - 1},1}} = {p\left( {0,1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (39) \\{{\Gamma_{{ij}\quad 4}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i - 1},{j - 1},1} & {{{{if}\quad\#^{- 1}y_{{i - 1},{j - 1},1}} = {p\left( {1,1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (40) \\{{\Gamma_{{ij}\quad 5}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i - 1},j,1} & {{{{if}\quad\#^{- 1}y_{{i - 1},j,1}} = {p\left( {1,1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (41) \\{{\Gamma_{{ij}\quad 6}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i - 1},{j + 1},1} & {{{{if}\quad\#^{- 1}y_{{i - 1},{j + 1},1}} = {p\left( {1,{- 1},0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (42) \\{{\Gamma_{{ij}\quad 7}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{i,{j + 1},1} & {{{{if}\quad\#^{- 1}y_{i,{j + 1},1}} = {p\left( {0,{- 1},0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (43) \\{{\Gamma_{{ij}\quad 8}^{*}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i + 1},{j + 1},1} & {{{{if}\quad\#^{- 1}y_{{i + 1},{j + 1},1}} = {p\left( {{- 1},{- 1},0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (44)\end{matrix}$

By using EQ.45, EQ.46 and EQ.47 instead of EQ.34, EQ.35 and EQ36, thus,transfer-source redundant information 183 of each of eight transfersources is generated from an eight-band grayscale image x consisting ofeight transfer-source redundant information 183 and a one-band grayscaleimage y consisting of redundant information 131.Λ*_(ijk)(x,y)=Γ_(ijk)(x,Δ(Φ(y)))+Γ*_(ijk)(Φ(y),Δ(Φ(y)))  (45)Λ′*_(ijk)(x,y)=Γ_(ijk)(x,Δ′(Φ(y)))+Γ*_(ijk)(Φ(y),Δ′(Φ(y)))  (46)Λ″*_(ijk)(x,y)=Γ_(ijk)(xΔ″(Φ(y)))+Γ*_(ijk)(Φ(y),Δ″(Φ(y)))  (47)

Note that Γ*_(ijk)(y, Δ(Φ(y))) can be also used instead ofΓ*_(ijk)(Φ(y), Δ(Φ(y))), according to situation.

Suppose that there are two images, x and y, where the image x is abinary image and the image y is a transfer-value image. Since a transferposition of each band-pixel value of the image x can be derived, someband-pixel values whose transfer position is redundant can also befound. EQ.48 generates a band-pixel value of a transferability imageappearing that a transfer position of each band-pixel value of the imagex is not redundant, and that the band-pixel value can also betransferred to another position. Note that the number of thetransferability image is equal to one. $\begin{matrix}{{H_{{ij}\quad 1}\left( {x,y} \right)} = \left\{ \begin{matrix}1 & {{{if}\quad x_{{ij}\quad 1}} = {{0\quad{and}\quad\#^{- 1}y_{l\quad m\quad 1}} = {p\left( {{i - l},{j - m},0} \right)}}} \\\quad & {{{{for}\quad{only}\quad{one}\quad{p\left( {l,m,1} \right)}} \in {P_{{ij}\quad 1}(q)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (48)\end{matrix}$

Suppose that there are three images, x, y and w, the image y is atransferability image, and the image w is a transfer-value image. EQ.49can transfer a band-pixel value of the image x. $\begin{matrix}{{T_{{ij}\quad k}\left( {x,y,w} \right)} = \left\{ \begin{matrix}x_{lmk} & {{{if}\quad y_{{ij}\quad 1}} = {{1\quad{and}\quad\#^{- 1}w_{l\quad m\quad 1}} = {p\left( {{i - l},{j - m},0} \right)}}} \\\quad & {{{{for}\quad{{\,^{3}p}\left( {l,m,1} \right)}} \in {P_{{ij}\quad 1}(q)}},} \\0 & {{{if}\quad y_{l\quad m\quad 1}} = {{1\quad{and}\quad\#^{- 1}w_{{ij}\quad 1}} = {p\left( {{l - i},{m - j},0} \right)}}} \\\quad & {{{{for}\quad{{\,^{3}p}\left( {l,m,1} \right)}} \in {P_{{ij}\quad 1}(q)}},} \\x_{ijk} & {{otherwise}.}\end{matrix} \right.} & (49)\end{matrix}$

By using EQ.32, EQ.48 and EQ.49, the band-pixel value of an image whichcan be derived by transferring a band-pixel value of the image x to thedirection against the center of gravity derived from the binary image ycan be simply described by EQ.50.U _(ijk)(x,y)=T _(ijk)(x,H(y,R(y)),R(y))  (50)

Algorithm of all array operation units 100 in a data processing device110, which can realize the image memorization means 12, thecolor-information generation means 41, the edge-information generationmeans 14, the edge-information formation means 15, the position/sizedetection means 17, the position/size/inclination detection means 44,the area normalization means 27, the mask means 40 and the image keepingmeans 39 shown in FIG. 10, can be described by EQ.2 to EQ.50. It isexplained here about the image memorization means 12, thecolor-information generation means 41, the edge-information generationmeans 14, the edge-information formation means 15, the position/sizedetection means 17, the position/size/inclination detection means 44,the area normalization means 27, the mask means 40, and the imagekeeping means 39, respectively, by representing the algorithm of anyarray operation unit 100 in the data processing device 110.

At step 1201, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 1202, neighbors of AOU_(ij) are set and its parameters areinitialized.

At step 1203, AOU_(ij) judges whether there is a digital image 111inputted one by one or not. If there is not the digital image 111 anymore (step 1203: YES), this algorithm ends. If there is the digitalimage 111 (step 1203: NO), this algorithm goes to step 1204. Note thatthis algorithm can be an infinite loop when array operation units 100are realized for a specific size of the image.

At step 1204, AOU_(ij) waits while the input digital image 111 is underpreparation.

At step 1205, AOU_(ij) inputs the whole pixel on the column i and therow j of the digital image 111. Therefore, AOU_(ij) needs a memory 102memorizing at least the number of bands of image data.

At step 1206, AOU_(ij) memorizes the pixel on the column i and the row jof the digital image 111, as outputting the pixel during waiting theinput data.

At step 1207, AOU_(ij) outputs all band-pixel values of the digitalimage 111. This algorithm then returns to step 1203.

The image memorization means 12 can memorize the digital image 111, byusing the data processing device 110 consisting of array operation units100.

As shown in FIG. 14, in order for the color-information generation means41 realized by a data processing device 110 to generate colorinformation 171 from each pixel of a digital image 111, array operationunits 100 arranged in the shape of a lattice work synchronously inparallel. Let an array operation unit 100 at a column i and a row j of amatrix be AOU_(ij). Algorithm of AOU_(ij) is shown in FIG. 15.

At step 4101, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 4102, neighbors of AOU_(ij) are set and its parameters areinitialized.

At step 4103, AOU_(ij) judges whether there is a digital image 111inputted one by one or not. If there is not the digital image 111 anymore (step 4103: YES), this algorithm ends. If there is the digitalimage 111 (step 4103: NO), this algorithm goes to step 4104. Note thatthis algorithm can be an infinite loop when array operation units 100are realized for a specific size of the image.

At step 4104, AOU_(ij) inputs the whole pixel on the column i and therow j of the digital image 111. Therefore, AOU_(ij) needs a memory 102memorizing at least the number of bands of image data.

At step 4105, AOU_(ij) generates color information 171 by extractingspecific colors from the pixel on the column i and the row j of thedigital image 111. The generated color information 171 is regarded as aband-pixel value of a color-information image 172.

At step 4106, AOU_(ij) outputs the band-pixel value of thecolor-information image 172. This algorithm then returns to step 4103.

The color-information generation means 41 can generate thecolor-information image 172 from the digital image 111, by using thedata processing device 110 consisting of array operation units 100.

As shown in FIG. 16, in order for the edge-information generation means14 realized by a data processing device 110 to generate a roughedge-information image 113 from a digital image 111, array operationunits 100 arranged in the shape of a lattice work synchronously inparallel. Let an array operation unit 100 at a column i and a row j of amatrix be AOU_(ij). Algorithm of AOU_(ij) is shown in FIG. 17.

At step 1401, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 1402, neighbors of AOU_(ij) are set and its parameters areinitialized. In setting the neighbors, the number of neighbors used inthe above functions can be defined as either four or eight individually,or all of them can be defined as either four or eight uniformly. Inorder to make rough edge information 112 generated by theedge-information generation means 14 of the present invention moreexact, the number of neighbors q has to be set to eight for allfunctions. The edge-information generation means 14, however, can copewith limitation of computational time to generate the rough edgeinformation 112 and the number of bands of the digital image 111, byvarying the number of neighbors suitably.

At step 1403, AOU_(ij) judges whether there is a digital image 111inputted one by one or not. If there is not the digital images 111 anymore (step 1403: YES), this algorithm ends. If there is the digitalimage 111 (step 1403: NO), this algorithm goes to step 1404. Note thatthis algorithm can be an infinite loop when array operation units 100are realized for a specific size of the image.

At step 1404, AOU_(ij) inputs the whole pixel on the column i and therow j of the digital image 111. This is done for AOU_(ij) to process thepixel on the column i and the row j of the digital image 111. Therefore,AOU_(ij) needs a memory 102 memorizing at least the number of bands ofimage data.

At step 1405, for each band-pixel value of the inputted digital image111, AOU_(ij) carries out smoothing according to the functionS_(ijk)(X), by communicating with neighbor array operation units 100.The smoothed band-pixel value is regarded as a band-pixel value of asmooth digital image. The function S_(ijk)(X) may be calculated sometimes if desired. It is enough for a general color image to repeat thefunction two times.

At step 1406, for each band-pixel value of the smooth digital image,AOU_(ij) carries out logarithm conversion according to the functionL_(ijk)(x). The band-pixel value converted to logarithm is regarded as aband-pixel value of a logarithmic-conversion image.

At step 1407, for each band-pixel value of the logarithmic-conversionimage, AOU_(ij) carries out enhancement according to the functionE_(ijk)(x), by communicating with neighbor array operation units 100.The enhanced band-pixel value is regarded as a band-pixel value of anenhanced image. Note that this step can be omitted if the digital image111 has much noise.

At step 1408, from each band-pixel value of the logarithmic-conversionimage, AOU_(ij) subtracts each band-pixel value of the previous enhancedimage, respectively, according to the function D_(ijk)(x, y). Theband-pixel value representing the difference is regarded as a band-pixelvalue of a time-differential image.

At step 1409, each band-pixel value of the previous enhanced image issuperseded by the corresponding band-pixel value of the enhanced image.

At step 1410, for each band-pixel value of the time-differential image,AOU_(ij) carries out calculation of Laplacian according to the operator∇_(ijk) ²x, by communicating with neighbor array operation units 100.The band-pixel value calculated by the Laplacian operator is regarded asa band-pixel value of a time-differential Laplacian image.

At step 1411, for each band-pixel value of the time-differentialLaplacian image, AOU_(ij) extracts zero-point according to the functionZ_(ijk)(x), by communicating with neighbor array operation units 100.The band-pixel value representing the extracted zero-point is regardedas a band-pixel value of a time-differential zero-point image.

At step 1412, for each band-pixel value of the time-differentialLaplacian image, AOU_(ij) detects the maximum value among someband-pixel values of the time-differential Laplacian image, according tothe function B_(ij1)(x). The band-pixel value representing the detectedmaximum value is regarded as a band-pixel value of a maximum-valuetime-differential zero-point image. Note that the number of bands, forconvenience' sake, is one.

At step 1413, for each band-pixel value of the enhanced image, AOU_(ij)carries out calculation of Laplacian according to the operator ∇_(ijk)²x, by communicating with neighbor array operation units 100. Theband-pixel value calculated by the Laplacian operator is regarded as aband-pixel value of a Laplacian image.

At step 1414, for each band-pixel value of the Laplacian image, AOU_(ij)extracts zero-point according to the function Z_(ijk)(x), bycommunicating with neighbor array operation units 100. The band-pixelvalue representing the extracted zero-point is regarded as a band-pixelvalue of a zero-point image.

At step 1415, for each band-pixel value of the Laplacian image, AOU_(ij)detects the maximum value among some band-pixel values of the Laplacianimage, according to the function B_(ij1)(x). The band-pixel valuerepresenting the detected maximum value is regarded as a band-pixelvalue of a maximum-value zero-point image. Note that the number ofbands, for convenience' sake, is one.

At step 1416, for each band-pixel value of the Laplacian image and eachband-pixel value of the time-differential Laplacian image, AOU_(ij)detects the maximum value between two band-pixel values at the sameposition of the images according to the function M_(ijk)(x, y). Theband-pixel value representing the detected maximum value is regarded asa band-pixel value of a mixed zero-point image. Note that the number ofbands, for convenience' sake, is one.

At step 1417, for a band-pixel value of the mixed zero-point image,AOU_(ij) deletes a hole according to the function P_(ijk)(x), bycommunicating with neighbor array operation units 100. The band-pixelvalue deleted the hole is regarded as a band-pixel value of ahole-deleted mixed zero-point image. Note that the number of bands, forconvenience' sake, is one. The function F_(ijk)(x) may be calculatedsome times if desired. It is enough for a general color image tocalculate the function one time.

At step 1418, for a band-pixel value of the hole-deleted mixedzero-point image, AOU_(ij) deletes an alone point and an alone holeaccording to the function A_(ijk)(x), by communicating with neighborarray operation units 100. The band-pixel value deleted the point andthe hole is regarded as a band-pixel value of a noise-canceled mixedzero-point image. Note that the number of bands, for convenience' sake,is one.

At step 1419, for a band-pixel value of the noise-canceled mixedzero-point image, AOU_(ij) inverts zero and one according to thefunction I_(ijk)(x). The inverted band-pixel value is regarded as aband-pixel value of a rough edge-information image 113.

At step 1420, AOU_(ij) outputs a band-pixel value of the roughedge-information image 113. This algorithm then returns to step 1403.

The edge-information generation means 14 can generate the roughedge-information image 113 from the digital image 111, by using the dataprocessing device 110 consisting of array operation units 100.

As shown in FIG. 18, in order for the edge-information formation means15 realized by a data processing device 110 to generate a formededge-information image 115 consisting of formed edge information 114from a rough edge-information image 113 consisting of rough edgeinformation 112 and a digital image 111, array operation units 100arranged in the shape of a lattice work synchronously in parallel. Letan array operation unit 100 at a column i and a row j of a matrix beAOU_(ij). Algorithm of AOU_(ij) is shown in FIG. 19.

At step 1501, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 1502, neighbors of AOU_(ij) are set and its parameters areinitialized. In setting the neighbors, the number of neighbors used inthe above functions can be defined as either four or eight individually,or all of them can be defined as either four or eight uniformly. Inorder to make formed edge information 114 formed by the edge-informationformation means 15 of the present invention more exact, the number ofneighbors q has to be set to eight for all functions. Theedge-information formation means 15, however, can cope with limitationof computational time to form the rough edge information 112 and thenumber of bands of the digital image 111, by varying the number ofneighbors suitably.

At step 1503, AOU_(ij) judges whether there is both a digital image 111and a rough edge-information image 113 inputted one by one or not. Ifthere is not the digital images 111 or the rough edge-information image113 any more (step 1503: YES), this algorithm ends. If there is eitherthe digital images 111 or the rough edge-information image 113 (step1503: NO), this algorithm goes to step 1504. Note that this algorithmcan be an infinite loop when array operation units 100 are realized fora specific size of the image.

At step 1504, AOU_(ij) inputs the whole pixel on the column i and therow j of the digital image 111 and the whole pixel on the column i andthe row j of the rough edge-information image 113. This is done forAOU_(ij) to process collectively the pixel on the column i and the row jof the digital image 111 and the pixel on the column i and the row j ofthe rough edge-information image 113. Therefore, AOU_(ij) needs a memory102 memorizing at least the number of bands of image data.

At step 1505, AOU_(ij) separates the pixel on the column i and the row jof the digital image 111 and the pixel on the column i and the row j ofthe rough edge-information image 113. This is done for AOU_(ij) toprocess the pixel on the column i and the row j of the digital image 111and the pixel on the column i and the row j of the roughedge-information image 113 as two pixel of independent images,respectively. If the pixel on the column i and the row j of the digitalimage 111 and the pixel on the column i and the row j of the roughedge-information image 113 are separated beforehand, followed by beinginputted, AOU_(ij) carries out nothing.

At step 1506, for each band-pixel value of the inputted digital image111, AOU_(ij) carries out smoothing according to the functionS_(ijk)(x), by communicating with neighbor array operation units 100.The smoothed band-pixel value is regarded as a band-pixel value of asmooth digital image. The function S_(ijk)(x) may be calculated sometimes if desired. It is enough for a general color image to repeat thefunction two times.

At step 1507, for each band-pixel value of the smooth digital image,AOU_(ij) carries out logarithm conversion according to the functionL_(ijk)(x). The band-pixel value converted to logarithm is regarded as aband-pixel value of a logarithmic-conversion image.

At step 1508, for each band-pixel value of the logarithmic-conversionimage, AOU_(ij) carries out enhancement according to the functionE_(ijk)(x), by communicating with neighbor array operation units 100.The enhanced band-pixel value is regarded as a band-pixel value of anenhanced image. Note that this step can be omitted if the digital image111 has much noise.

At step 1509, for each band-pixel value of the enhanced image, AOU_(ij)carries out calculation of Laplacian according to the operator ∇_(ijk)²x, by communicating with neighbor array operation units 100. Theband-pixel value calculated by the Laplacian operator is regarded as aband-pixel value of a Laplacian image.

At step 1510, for each band-pixel value of the Laplacian image, AOU_(ij)extracts zero-point according to the function Z_(ijk)(x), bycommunicating with neighbor array operation units 100. The band-pixelvalue representing the extracted zero-point is regarded as a band-pixelvalue of a zero-point image.

At step 1511, for each band-pixel value of the zero-point image,AOU_(ij) detects the maximum value among some band-pixel values of thezero-point image, according to the function B_(ij1)(x). The band-pixelvalue representing the detected maximum value is regarded as aband-pixel value of a maximum-value zero-point image. Note that thenumber of bands, for convenience' sake, is one.

At step 1512, for a band-pixel value of the maximum-value zero-pointimage, AOU_(ij) inverts zero and one according to the functionI_(ijk)(x). The inverted band-pixel value is regarded as a band-pixelvalue of a based edge-information image.

At step 1513, the band-pixel value of the input rough edge-informationimage 113 first is regarded as a band-pixel value of an orthopedicalrough edge-information image. For a band-pixel value of the orthopedicalrough edge-information image, AOU_(ij) operates orthopedically accordingto the function Q_(ijk)(x, y). The band-pixel value operatedorthopedically is regarded as a band-pixel value of an orthopedicalrough edge-information image again. The function Q_(ijk)(x, y) isrepeated by nature until the band-pixel value of the orthopedical roughedge-information image stops changing. However, it is better forAOU_(ij) to close this orthopedical processing in some specific repeattimes, corresponding to limitation of computational time, quality of theinput rough edge-information image 113, quality desired for the formededge-information image 115.

At step 1514, for a band-pixel value of the orthopedical roughedge-information image, AOU_(ij) complements line width according to thefunction C_(ijk)(x), by communicating with neighbor array operationunits 100. The complemented band-pixel value is regarded as a band-pixelvalue of a formed edge-information image 115.

At step 1515, AOU_(ij) outputs a band-pixel value of the formededge-information image 115. This algorithm then returns to step 1503.

The edge-information formation means 15 can generate the formededge-information image 115 from the rough edge-information image 113, byusing the data processing device 110 consisting of array operation units100.

We can regard here that the formation from the rough edge-informationimage 113 to the formed edge-information image 115 is to inference edgeinformation to be generated from a high-resolution digital image 111taken in a scene, from edge information generated from a low-resolutiondigital image 111 taken in the same scene. As shown in FIG. 20, for anatural number n, the rough edge-information image 113 can be generatedby expanding a low-resolution rough edge-information image 117 n times,when the edge-information generation means 14 generates thelow-resolution rough edge-information image 117 from the low-resolutiondigital image 116 whose resolution is equivalent to 1/n resolution ofthe digital image 111. In order to decrease the resolution of thedigital image 111 to 1/n, we only have to extract one of n pixelssuccessive horizontally or vertically in the digital image 111. On theother hand, in order to expand the low-resolution rough edge-informationimage 117 n times, we only have to fill in successive pixels of thelow-resolution rough edge-information image 117 with n−1 pixels whoseband-pixel value is equivalent to zero. Suppose here that a roughedge-information image 113 is made by expanding a low-resolution roughedge-information image 117, and another rough edge-information image 113is generated from the digital image 111. If n is not too large, a formededge-information image 115, to which a data processing device 110realizing the edge-information formation means 15 forms the former roughedge-information image 113, becomes almost same as a formededge-information image 115, to which a data processing device 110realizing the edge-information formation means 15 forms the latter roughedge-information image 113. This reason is because the edge-informationformation means 15 only uses the rough edge-information image 113 torefer which of edge information is used, where the edge information isgenerated by the edge-information formation means 15 itself from digitalimage 111. Therefore, in a case that the edge-information formationmeans 15 inputs a rough edge-information image 113 made by expanding alow-resolution rough edge-information image 117, a data processingdevice 110 realizing the edge-information generation means 14, whichgenerates the low-resolution rough edge-information image 117 from alow-resolution digital image 116, can reduce volume of hardware.

When this method is developed, furthermore, as shown in FIG. 21, thedata processing device 110 can cut a low-resolution cut roughedge-information image 118 around the rough edge information 112 out ofthe low-resolution rough edge-information image 117 generated fromlow-resolution digital image 116 which is a low resolution of thedigital image 111. Suppose that the data processing device 110 realizingthe edge-information formation means 14 inputs a cut roughedge-information image 119 made by expanding this low-resolution cutrough edge-information image 118 and a cut digital image 120 which isthe same cut domain of the digital image 111 as the cut roughedge-information image 119. The data processing device 110 can generatea cut formed edge-information image 121. In this case, the dataprocessing device 110 realizing the edge-information formation means 15can reduce volume of hardware. Note that the visual device 2 can beregarded as a device that changes direction and magnification of themoving camera 10, as the cut digital image 120 always comes to belocated at the center of the digital image 111.

As shown in FIG. 22, in order for the position/size detection means 17realized by a data processing device 110 to generate aredundant-information image 132 consisting of redundant information 131from a rough edge-information image 113 consisting of rough edgeinformation 112, array operation units 100 arranged in the shape of alattice work synchronously in parallel. Let an array operation unit 100at a column i and a row j of a matrix be AOU_(ij). Algorithm of AOU_(ij)is shown in FIG. 23.

At step 1701, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 1702, neighbors of AOU_(ij) are set and its parameters areinitialized. In setting the neighbors, the number of neighbors used inthe above functions can be defined as either four or eight individually,or all of them can be defined as either four or eight uniformly. Inorder to make the redundant-information image 132 generated by the dataprocessing device 110 of the present invention more exact, the number ofneighbors q has to be set a large number for all functions. Theposition/size detection means 17, however, can cope with limitation ofcomputational time to calculate gravity of the rough edge information112 of an object and the size of the input rough edge-information image113, by varying the number of neighbors suitably.

At step 1703, AOU_(ij) judges whether there is a rough edge-informationimage 113 inputted one by one or not. If there is not the roughedge-information image 113 any more (step 1703: YES), this algorithmends. If there is the rough edge-information image 113 (step 1703: NO),this algorithm goes to step 1704. Note that this algorithm can be aninfinite loop when array operation units 100 are realized for a specificsize of the image.

At step 1704, AOU_(ij) inputs one band of a pixel on the column i andthe row j of the rough edge-information image 113. Therefore, AOU_(ij)needs a memory 102 memorizing at least one band of image data.

At step 1705, AOU_(ij) converts the rough edge information 112 to therough edge-information image 113. The redundant information 131 becomesa band-pixel value equivalent to one or zero.

At step 1706, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) calculates a transfer value according to thefunction Δ_(ij1)(x), by communicating with neighbor array operationunits 100. The band-pixel value representing the transfer value isregarded as a band-pixel value of a transfer-value image.

At step 1707, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) transfers it according to the function Λ_(ij1)(x),by communicating with neighbor array operation units 100. Thetransferred band-pixel value is regarded as a band-pixel value of a newredundant-information image 132.

At step 1708, AOU_(ij) judges whether the transfer times representingthe repeat times from step 1706 to step 1707 achieve the directed timesor not. If the transfer times do not achieve the directed times (step1708: NO), this algorithm returns to step 1706. If the transfer timesachieve the directed times (step 1708: YES), this algorithm goes to step1709. Note that the directed times are derived by the size of the roughedge-information image 113, the size of the object represented by therough edge information 112, and the number of neighbors q. In a casethat some parameters are set to specific numbers corresponding to theaim of use, there is no problem even though the directed times are setto more than the necessary times. If the directed times are too much,however, AOU_(ij) takes much time to detect the position and the size ofthe object.

At step 1709, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) calculates a transfer value according to thefunction Δ′_(ij1)(x), by communicating with neighbor array operationunits 100. The band-pixel value representing the transfer value isregarded as a band-pixel value of the transfer-value image.

At step 1710, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) transfers it according to the function Λ′_(ij1)(x),by communicating with neighbor array operation units 100. Thetransferred band-pixel value is regarded as a band-pixel value of a newredundant-information image 132.

At step 1711, AOU_(ij) outputs a band-pixel value of theredundant-information image 132. This algorithm then returns to step1703.

Note that each redundant information 131 of the redundant-informationimage 132 consequently means the size of the object, whose center is aposition of the redundant-information image 132, because it means thetotal number of the rough edge information 112 around the position.

The position/size detection means 17 can generate theredundant-information image 132 from the rough edge-information image113, by using the data processing device 110 consisting of arrayoperation units 100.

By the way, suppose that an object-area image 142 representing an objectarea 141 is used in the algorithm shown in FIG. 23, instead of the roughedge-information image 113 consisting of the rough edge information 112.As shown in FIG. 24, the position/size detection means 17 realized bythe data processing device 110 can also generate theredundant-information image 132 representing redundant information 131from the object-area image 142 representing the object area 141. In thecase that the object-area image 142 is used, however, each redundantinformation 131 of the redundant-information image 132 consequentlymeans the area of the object, whose center is a position of theredundant-information image 132, because it means the total number ofpixels of the object area 141 around the position. When the size of theobject is derived from the redundant-information image 132, therefore,we must pay attention such as calculating the square root of theredundant information 131. Note that the position/size detection means17 also carries out this algorithm similarly, in two cases that a formededge-information image 115 and a color-information image 172 are used,respectively.

As shown in FIG. 25, in order for the position/size/inclinationdetection means 44 realized by a data processing device 110 to generatea redundant-information image 132 consisting of redundant information131 from a rough edge-information image 113 consisting of rough edgeinformation 112, array operation units 100 arranged in the shape of alattice work synchronously in parallel. Let an array operation unit 100at a column i and a row j of a matrix be AOU_(ij). Algorithm of AOU_(ij)is shown in FIG. 26.

At step 4401, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 4402, neighbors of AOU_(ij) are set and its parameters areinitialized. In setting the neighbors, the number of neighbors used inthe above functions can be defined as either four or eight individually,or all of them can be defined as either four or eight uniformly. Inorder to make the redundant-information image 132 generated by the dataprocessing device 110 of the present invention more exact, the number ofneighbors q has to be set a large number for all functions. Theposition/size/inclination detection means 44, however, can cope withlimitation of computational time to calculate gravity of the rough edgeinformation 112 of an object and the size of the input roughedge-information image 113, by varying the number of neighbors suitably.

At step 4403, AOU_(ij) judges whether there is a rough edge-informationimage 113 inputted one by one or not. If there is not the roughedge-information image 113 any more (step 4403: YES), this algorithmends. If there is the rough edge-information image 113 (step 4403: NO),this algorithm goes to step 4404. Note that this algorithm can be aninfinite loop when array operation units 100 are realized for a specificsize of the image.

At step 4404, AOU_(ij) inputs one band of a pixel on the column i andthe row j of the rough edge-information image 113. Therefore, AOU_(ij)needs a memory 102 memorizing at least one band of image data.

At step 4405, AOU_(ij) converts the rough edge information 112 to therough edge-information image 113. The redundant information 131 becomesa band-pixel value equivalent to one or zero. Eight transfer-sourceredundant information 183 are also cleared by a band-pixel valueequivalent to zero.

At step 4406, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) calculates a transfer value according to thefunction Δ_(ij1)(x), by communicating with neighbor array operationunits 100. The band-pixel value representing the transfer value isregarded as a band-pixel value of a transfer-value image.

At step 4407, for each band-pixel value of the transfer-sourceredundant-information image 184, AOU_(ij) transfers it according to thefunction Λ*_(ijk)(x, y), by communicating with neighbor array operationunits 100. The transferred band-pixel value is regarded as a band-pixelvalue of a new transfer-source redundant-information image 184.

At step 4408, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) transfers it according to the function Λ_(ij1)(x),by communicating with neighbor array operation units 100. Thetransferred band-pixel value is regarded as a band-pixel value of a newredundant-information image 132.

At step 4409, AOU_(ij) judges whether the transfer times representingthe repeat times from step 4406 to step 4408 achieve the directed timesor not. If the transfer times do not achieve the directed times (step4409: NO), this algorithm returns to step 4406. If the transfer timesachieve the directed times (step 4409: YES), this algorithm goes to step4410. Note that the directed times are derived by the size of the roughedge-information image 113, the size of the object represented by therough edge information 112, and the number of neighbors q. In a casethat some parameters are set to specific numbers corresponding to theaim of use, there is no problem even though the directed times are setto more than the necessary times. If the directed times are too much,however, AOU_(ij) takes much time to detect the position and the size ofthe object.

At step 4410, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) calculates a transfer value according to thefunction Δ′_(ij1)(x), by communicating with neighbor array operationunits 100. The band-pixel value representing the transfer value isregarded as a band-pixel value of the transfer-value image.

At step 4411, for each band-pixel value of the transfer-sourceredundant-information image 184, AOU_(ij) transfers it according to thefunction Λ′*_(ijk)(x, y), by communicating with neighbor array operationunits 100. The transferred band-pixel value is regarded as a band-pixelvalue of a new redundant-information image 132.

At step 4412, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) transfers it according to the function Λ′_(ij1)(x),by communicating with neighbor array operation units 100. Thetransferred band-pixel value is regarded as a band-pixel value of a newredundant-information image 132.

At step 4413, AOU_(ij) judges whether the degeneration timesrepresenting the repeat times from step 4406 to step 4412 achieve thedirected times or not. If the degeneration times do not achieve thedirected times (step 4413: NO), this algorithm returns to step 4406. Ifthe degeneration times achieve the directed times (step 4413: YES), thisalgorithm goes to step 4414. Note that the directed times are derived bythe size of the rough edge-information image 113, the size of the objectrepresented by the rough edge information 112, and the number ofneighbors q. In a case that some parameters are set to specific numberscorresponding to the aim of use, there is no problem even though thedirected times are set to more than the necessary times. If the directedtimes are too much, however, AOU_(ij) takes much time to detect theposition and the size of the object.

At step 4414, AOU_(ij) outputs a band-pixel value of theredundant-information image 132 and each band-pixel value of thetransfer-source redundant-information image 184. This algorithm thenreturns to step 4403.

Note that each redundant information 131 of the redundant-informationimage 132 consequently means the size of the object, whose center is aposition of the redundant-information image 132, because it means thetotal number of the rough edge information 112 around the position. Eachtransfer-source redundant information 183 consequently means theinclination of the object, whose center is a position of theredundant-information image 132, because it means the transfer-sourceredundant information 183 exists only at the pixel which has theredundant information 131.

Therefore, the position/size/inclination detection means 44 can generatethe redundant-information image 132 and the transfer-sourceredundant-information image 184 from the rough edge-information image113, by using the data processing device 110 consisting of arrayoperation units 100. However, if a rough gravity position of an objectrepresented by the redundant-information image 132 shifts much from itsreal gravity center, the function Δ′_(ij1)(x) and the functionΔ″_(ij1)(x) can be used alternately in step 4410. Similarly, thefunction Λ′*_(ijk)(x, y) and the function Λ′*_(ijk)(x, y) can be usedalternately in step 4411. In addition, the function Λ′_(ij1)(x) and thefunction Λ″_(ij1)(x) can be used alternately in step 4412.

Here, the formed edge-information image 115 consisting of the formededge information 114 can be used in the algorithm shown in FIG. 26,instead of the rough edge-information image 113 consisting of the roughedge information 112. In addition, suppose that an object-area image 142representing an object area 141 is used, instead of the roughedge-information image 113 consisting of the rough edge information 112.As shown in FIG. 27, the position/size/inclination detection means 44can generate the redundant-information image 132 and the transfer-sourceredundant-information image 184 even from the object-area image 142representing the object area 141. In the case that the object-area image142 is used, however, each redundant information 131 of theredundant-information image 132 consequently means the area of theobject, whose center is a position of the redundant-information image132, because it means the total number of pixels of the object area 141around the position. When the size of the object is derived from theredundant-information image 132, therefore, we must pay attention suchas calculating the square root of the redundant information 131. Notethat the position/size/inclination detection means 44 also carries outthis algorithm similarly, in a case that a color-information image 172representing whether there are some specific colors of objects or not,is used instead of the object-area image 142.

It has been described above about a method generating thetransfer-source redundant-information image 184 from the roughedge-information image 113, the formed edge-information image 115, theobject-area image 142 and the color-information image 172. It isexplained here about a method deriving inclination angle of an objectfrom the transfer-source redundant-information image 183.

Suppose first that transfer-source redundant information 183, whosetransfer source is either one of neighbor 1 to neighbor 8 shown in FIG.12 and FIG. 28, is denoted as N1 to N8, respectively. For example, theinclination angle θ represented counter-clockwisely is derived accordingto EQ.51, where the inclination angle θ is represented by radian, andthe inclination angle θ comes to be 0 radian when the object ishorizontal or vertical. $\begin{matrix}{\theta = \left\{ \begin{matrix}0 & {{{{{if}\quad N\quad 2} + {N\quad 6}} = {{{0\quad{and}\quad N\quad 4} + {N\quad 8}} = 0}},} \\{{\arctan\left( \frac{{N\quad 2} + {N\quad 6}}{{N\quad 4} + {N\quad 8}} \right)} - \frac{\pi}{4}} & {{{{if}\quad N\quad 1} + {N\quad 5}} \geq {{N\quad 3} + {N\quad 7}}} \\\quad & {{{{{except}\quad N\quad 2} + {N\quad 6}} = {{{0\quad{and}\quad N\quad 4} + {N\quad 8}} = 0}},} \\{{\arctan\left( \frac{{N\quad 4} + {N\quad 8}}{{N\quad 2} + {N\quad 6}} \right)} - \frac{\pi}{4}} & {{otherwise}.}\end{matrix} \right.} & (51)\end{matrix}$

For example, in a case that the transfer-source redundant-information183 whose transfer source is either one of N1 to N8 is like FIG. 28, theinclination angle θ is about −0.4 radians. Although EQ.51 is a simpleequation for deriving the inclination angle θ, of course, a user of thepresent invention can derive the inclination angle θ more exact, byperforming finer conditioning than EQ.51. Besides this, EQ.52 is used inorder to derive the inclination angle θ from a horizontal axis.$\begin{matrix}{\theta = \left\{ \begin{matrix}0 & {{{{{if}\quad N\quad 2} + {N\quad 6}} = {{{0\quad{and}\quad N\quad 4} + {N\quad 8}} = 0}},} \\{{\arctan\left( \frac{{N\quad 2} + {N\quad 6}}{{N\quad 4} + {N\quad 8}} \right)} - \frac{\pi}{4}} & {{{{{if}\quad N\quad 1} + {N\quad 5}} \geq {{N\quad 3} + {N\quad 7\quad{and}\quad N\quad 2} + {N\quad 6}} \geq {{N\quad 4} + {N8}}}\quad} \\\quad & {{{{{except}\quad N\quad 2} + {N\quad 6}} = {{{0\quad{and}\quad N\quad 4} + {N\quad 8}} = 0}},} \\{{\arctan\left( \frac{{N\quad 2} + {N\quad 6}}{{N\quad 4} + {N\quad 8}} \right)} + \frac{3\pi}{4}} & {{{{{{if}\quad N\quad 1} + {N\quad 5}} \geq {{N\quad 3} + {N\quad 7\quad{and}{\quad\quad}N\quad 2} + {N\quad 6}} < {{N\quad 4} + {N\quad 8}}},}\quad} \\{{\arctan\left( \frac{{N\quad 4} + {N\quad 8}}{{N\quad 2} + {N\quad 6}} \right)} + \frac{\pi}{4}} & {{otherwise}.}\end{matrix} \right.} & (52)\end{matrix}$

Note that the function arctan(y/x) do not have to use a table oflogarithms if the inclination angle θ can be approximated. For example,if the inclination angle θ is only have to get either 0 radian, π/4radian, π/2 radian or 3π/4 radian, the function arctan(y/x) has betterbe approximated like EQ.53. $\begin{matrix}{{\arctan\quad\left( \frac{y}{x} \right)} \approx \left\{ \begin{matrix}0 & {{{{if}\quad x} = {{0\quad{and}\quad y} = 0}},} \\0 & {{{{if}\quad 0} \leq y < {x/2}},} \\\frac{\pi}{4} & {{{{if}\quad 0} < {y/2} \leq x \leq {2\quad y}},} \\\frac{\pi}{2} & {{{{if}\quad 0} \leq x < {y/2}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (53)\end{matrix}$

If an array operation unit 100 calculates EQ.51 and EQ.52, and generatesinclination-size information 185 consisting of the redundant information131 and the inclination angle θ, the array operation unit 100 can outputa less amount of data than eight quantities of transfer-source redundantinformation 183. For example, in a case that the number of inclinationangles θ is specified with four, an inclination-size-information image186 becomes a four-band image if redundant information 131 correspondingto each inclination angle is assigned to an individual band-pixel value.In addition, if four inclination angles θ are represented by aband-pixel value, the inclination-size-information image 186 becomes atwo-band image. Besides this, if the inclination angle θ can berepresented by a specific interval, a memory 102 only has to memorize alook-up table preparing the necessary number of the inclination angles,instead of a table of logarithms. Of course, the array operation unit100 may use an approximate function like EQ.53.

By the way, a rough edge-information image 113 comprising rough edgeinformation 112 and an object area image 142 comprising an object area141 generated for an object are inputted by a position/size/inclinationdetection means 44 in FIG. 25 and FIG. 27, respectively. Of course,however, even though there are some objects in the roughedge-information image 113 and the object area image 142, theposition/size/inclination detection means 44 can detect position, sizeand inclination of each object. As shown in FIG. 29, moreover, eventhough a color-information image 172 shows texture, theposition/size/inclination detection means 44 can detect position, sizeand inclination from each chunk of color information 171. Therefore, theposition/size/inclination detection means 44 can be also used to analyzetexture.

Now, it has been described above about the position/size/inclinationdetection means 44. As is clear from the above description, if contoursof an object in a rough edge-information image 113 is represented bymany line segments whose intervals are equal, theposition/size/inclination detection means 44 can derive length andinclination of the line segments. In order to generate such a roughedge-information image 113 for any object at any place, however, aspecial image processing device using many large masks are optionallyneeded. Therefore, the position/size/inclination detection means 44 canreally input only a rough edge-information image 113 or a formededge-information image 115 including the little number of line segmentsfor an object. Thus, the position/size/inclination detection means 44can not derive length and inclination of line segments representingcontours of an object from the rough edge-information image 113,whenever the above method is used.

By the way, in a case that the position/size/inclination detection means44 carries out local processing for only eight neighbors 182, that is,in a case that neighbor size q is eight in step 4406 and step 4410 inFIG. 26, the position/size/inclination detection means 44 may be able toderive normal direction of some line segments and curves constructed byrough edge information 112 in the rough edge-information image 113, ifsome condition is satisfied. Especially, in a case that line width ofsome line segments and curves in the rough edge-information image 113 isapproximated to two or three pixels, that is, for a formededge-information image 114, the position/size/inclination image 44 cancertainly divide the line segments and the curves into formed edgeinformation 114 whose size is less than a specific value. Moreover, itcan derive angles in the normal direction of the line segments and thecurves. For example, in a case of FIG. 31, the position/size/inclinationdetection means 44 outputs a 45-degree angle against a horizontal axisfor a line segment in the formed edge-information image 115, which leansat 135 degrees against the horizontal axis. Of course, size of an objectoutputted by the position/size/inclination detection means 44 becomeslength of the line segment leaning at 135 degrees against the horizontalaxis. In addition, in a case of FIG. 32, the position/size/inclinationdetection means 44 divides a cross-shape figure in the formededge-information image 115 into five line segments, followed byoutputting a 90-degree angle against a horizontal line segment in theformed edge-information image 115, and a 0-degree angle against avertical line segment in the formed edge-information image 115. Next, ina case of FIG. 33, the position/size/inclination detection means 44divides a triangle in the formed edge-information image 115 into sixline segments, followed by outputting their normal angles in the formededge-information image 115, respectively. Next, in a case of FIG. 34,the position/size/inclination detection means 44 divides a rectangle inthe formed edge-information image 115 into eight line segments, followedby outputting their normal angles in the formed edge-information image115, respectively. Note that, as is clear from FIG. 34, four angles ofthe rectangle are converted into short line segments leaning toward acenter of gravity of the rectangle, respectively. Next, in a case ofFIG. 35, the position/size/inclination detection means 44 divides arectangle (we here call it a rhombus) leaning at 90 degrees in theformed edge-information image 115 into six line segments, followed byoutputting their normal angles in the formed edge-information image 115,respectively. Finally, in a case of FIG. 36, theposition/size/inclination detection means 44 divides a circle in theformed edge-information image 115 into eight line segments, followed byoutputting their normal angles in the formed edge-information image 115,respectively. Thus, if the position/size/inclination detection means 44adds these normal angles to 90 degrees, by using EQ.54, theposition/size/inclination detection means 44 can derive tangent anglesof the line segments and the curves representing the contours of theobject in the formed edge-information image 115. $\begin{matrix}{\theta^{\prime} = {\left( {\theta + \frac{\pi}{2}} \right)\quad{mod}\quad\pi}} & (54)\end{matrix}$

Note that the position/size/inclination detection means 44 can also useEQ.52 if the geometrical analysis means 37 regards as theposition/size/inclination detection means 44 outputs normal angles ofthe line segments and the curves representing the contours of the objectin the formed edge-information image 115.

For each of all objects in the formed edge-information image 115, here,if the geometrical analysis means 37 can collect inclination-sizeinformation 185 of an inclination-size-information image 186 outputtedby the position/size/inclination detection means 44 at one place, thegeometrical analysis means 37 can discriminate form of the object. Sucha method collecting plurality of information at one place has alreadybeen realized by the position/size/inclination detection means 44.However, since inclination-size information 185 related with an objectis distributed around the inclination-size-information image 186, it isdifficult for the geometrical analysis means 37 to collect theinclination-size information 185 at one place in a similar method to theposition/size/inclination detection means 44, as shown in FIG. 29. It isexplained here about a position/size/form detection means 45 collectingthe inclination-size information 185 at one place, by using the formededge-information image 115.

First, EQ.37 to EQ.44 are expanded to EQ.55 to EQ.62, respectively. Notethat, in a case that a range possible to be taken by an inclinationangle θ of a line segment represented by the inclination-sizeinformation 185, which is zero or more degrees and less than 180degrees, is segmented into some domains, k denotes a number assigned toeach domain. For example, suppose the inclination angle θ is segmentedinto four domains of 0 degree, 45 degrees, 90 degrees and 135 degrees. kdenotes the domain of 0 degree if k=0, k denotes the domain of 45 degreeif k=1, k denotes the domain of 90 degree if k=2, and k denotes thedomain of 135 degree if k=3. $\begin{matrix}{\quad{{\Gamma_{i,j,{{9\quad k} + 1}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i + 1},j,{{9\quad k} + 9}} & {{{{if}\quad\#^{- 1}y_{{i + 1},j,1}} = {p\left( {{- 1},0,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.}} & (55) \\{\quad{{\Gamma_{i,j,{{9\quad k} + 2}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i + 1},{j - 1},{{9\quad k} + 9}} & {{{{if}\quad\#^{- 1}y_{{i + 1},{j - 1},1}} = {p\left( {{- 1},1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.}} & (56) \\{\quad{{\Gamma_{i,j,{{9\quad k} + 3}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{i,{j - 1},{{9\quad k} + 9}} & {{{{if}\quad\#^{- 1}y_{i,{j - 1},1}} = {p\left( {0,1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.}} & (57) \\{\quad{{\Gamma_{i,j,{{9\quad k} + 4}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i - 1},{j - 1},{{9\quad k} + 9}} & {{{{if}\quad\#^{- 1}y_{{i - 1},{j - 1},1}} = {p\left( {1,1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.}} & (58) \\{\quad{{\Gamma_{i,j,{{9\quad k} + 5}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i - 1},j,{{9\quad k} + 9}} & {{{{if}\quad\#^{- 1}y_{{i - 1},j,1}} = {p\left( {1,1,0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.}} & (59) \\{\quad{{\Gamma_{i,j,{{9\quad k} + 6}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i - 1},{j + 1},{{9\quad k} + 9}} & {{{{if}\quad\#^{- 1}y_{{i - 1},{j + 1},1}} = {p\left( {1,{- 1},0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.}} & (60) \\{\quad{{\Gamma_{i,j,{{9\quad k} + 7}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{i,{j + 1},{{9\quad k} + 9}} & {{{{if}\quad\#^{- 1}y_{i,{j + 1},1}} = {p\left( {0,{- 1},0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.}} & (61) \\{{\Gamma_{i,j,{{9k} + 8}}^{**}\left( {x,y} \right)} = \left\{ \begin{matrix}x_{{i + 1},{j + 1},{{9k} + 9}} & {{{{if}\quad\#^{- 1}y_{{i + 1},{j + 1},1}} = {p\left( {{- 1},{- 1},0} \right)}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (62)\end{matrix}$

Of course, it is possible to segment the inclination angle θ into anynumber of domains, but this condition is used here in order to explaineasily. Note that, if k is equal to zero in EQ.55 to EQ.62, EQ.55 toEQ.62 become EQ.37 to EQ.44, respectively. In theposition/size/inclination detection means 44, therefore, each of thearray operation units 100 can use EQ.55 to EQ.62 instead of EQ.37 toEQ.44, respectively.

Next, EQ.63 is appended to EQ.55 to EQ.62. The EQ.63 is used forcalculating sum of length of line segments represented byinclination-size information 185 included within each domain of theinclination angles θ in the inclination-size information image 186.Γ**_(i,j,9k+9)(x,y)=0  (63)

By using EQ.64, EQ.65 and EQ.66 instead of EQ.45, EQ.46 and EQ.47,transfer-source inclination-redundant information 187 of each of eighttransfer sources and transfer-source inclination-redundant information187 representing the sum of length of the line segments represented byinclination-size information 185 are generated from a 36-band grayscaleimage x consisting of 36 amounts of transfer-sourceinclination-redundant-information 187 and a single-band grayscale imagey consisting of redundant information 131, every domain of theinclination angle θ.Λ**_(ijk)(x,y)=Γ_(ijk)(x,Δ(Φ(y)))+Γ**_(ijk)(x,Δ(Φ(y)))  (64)Λ′**_(ijk)(x,y)=Γ_(ijk)(x,Δ′(Φ(y)))+Γ**_(ijk)(x,Δ′(Φ(y)))  (65)Λ″**_(ijk)(x,y)=Γ_(ijk)(x,Δ″(Φ(y)))+Γ**_(ijk)(x,Δ″(Φ(y)))  (66)

Now, as shown in FIG. 37 to FIG. 41, in order for the position/size/formdetection means 45 realized by a data processing device 110 to generatea redundant-information image 132 consisting of redundant information131 from a formed edge-information image 115 consisting of formed edgeinformation 114, and to generate a transfer-sourceinclination-redundant-information image 188 consisting oftransfer-source inclination-redundant information 187 from aninclination-size information image 186 consisting of inclination-sizeinformation 185, array operation units 100 arranged in the shape of alattice work synchronously in parallel. Let an array operation unit 100at a column i and a row j of a matrix be AOU_(ij). Algorithm of AOU_(ij)is shown in FIG. 42.

At step 4501, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 4502, neighbors of AOU_(ij) are set and its parameters areinitialized. In setting the neighbors, the number of neighbors used inthe above functions can be defined as either four or eight individually,or all of them can be defined as either four or eight uniformly. Inorder to make the redundant-information image 132 generated by the dataprocessing device 110 of the present invention more exact, the number ofneighbors q has to be set a large number for all functions. Theposition/size/inclination detection means 44, however, can cope withlimitation of computational time to calculate gravity of the formed edgeinformation 114 of an object and the size of the input formededge-information image 115, by varying the number of neighbors suitably.

At step 4503, AOU_(ij) judges whether there is a formed edge-informationimage 115 inputted one by one or not. If there is not the formededge-information image 115 any more (step 4503: YES), this algorithmends. If there is the formed edge-information image 115 (step 4503: NO),this algorithm goes to step 4504. Note that this algorithm can be aninfinite loop when array operation units 100 are realized for a specificsize of the image.

At step 4504, AOU_(ij) inputs one band of a pixel on the column i andthe row j of the formed edge-information image 115 and one band of apixel on the column i and the row j of the inclination-size-informationimage 186. Therefore, AOU_(ij) needs a memory 102 memorizing at leastone band of image data.

At step 4505, AOU_(ij) separates the pixel on the column i and the row jof the formed edge-information image 115 and the pixel on the column iand the row j of the inclination-size-information image 186. If thepixel on the column i and the row j of the formed edge-information image115 and the pixel on the column i and the row i of theinclination-size-information image 186 are separated beforehand,followed by being inputted, AOU_(ij) carries out nothing.

At step 4506, AOU_(ij) converts the formed edge information 114 of theformed edge-information image 115 to the redundant information 131 ofthe redundant-information image 132. The redundant information 131becomes a pixel value equivalent to one or zero.

At step 4507, AOU_(ij) converts the inclination-size information 185 ofthe inclination-size-information image 186 to the transfer-sourceinclination-redundant information 187 of the transfer-sourceinclination-redundant-information image 188. For each of all domains ofan inclination angle θ represented by the inclination-size information185, the transfer-source inclination-redundant information 187 at acenter becomes a band-pixel value equivalent to a non-negative integer.In addition, 32 of transfer-source inclination-redundant information 187are also cleared by a band-pixel value equivalent to zero.

At step 4508, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) calculates a transfer value according to thefunction Δ_(ij1)(x), by communicating with neighbor array operationunits 100. The band-pixel value representing the transfer value isregarded as a band-pixel value of a transfer-value image.

At step 4509, for each band-pixel value of the transfer-sourceinclination-redundant-information image 188, AOU_(ij) transfers itaccording to the function Λ**_(ijk)(x, y), by communicating withneighbor array operation units 100. The transferred band-pixel value isregarded as a band-pixel value of a new transfer-sourceinclination-redundant-information image 188.

At step 4510, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) transfers it according to the function Λ_(ij1)(x),by communicating with neighbor array operation units 100. Thetransferred band-pixel value is regarded as a band-pixel value of a newredundant-information image 132.

At step 4511, AOU_(ij) judges whether the transfer times representingthe repeat times from step 4508 to step 4510 achieve the directed timesor not. If the transfer times do not achieve the directed times (step4511: NO), this algorithm returns to step 4508. If the transfer timesachieve the directed times (step 4511: YES), this algorithm goes to step4512. Note that the directed times are derived by the size of the formededge-information image 115, the size of the object represented by theformed edge information 114, and the number of neighbors q. In a casethat some parameters are set to specific numbers corresponding to theaim of use, there is no problem even though the directed times are setto more than the necessary times. If the directed times are too much,however, AOU_(ij) takes much time to detect the position, the size andthe form of the object.

At step 4512, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) calculates a transfer value according to thefunction Δ′_(ij1)(x), by communicating with neighbor array operationunits 100. The band-pixel value representing the transfer value isregarded as a band-pixel value of the transfer-value image.

At step 4513, for each band-pixel value of the transfer-sourceinclination-redundant-information image 188, AOU_(ij) transfers itaccording to the function Λ′**_(ijk)(x,y), by communicating withneighbor array operation units 100. The transferred band-pixel value isregarded as a band-pixel value of a new transfer-sourceinclination-redundant-information image 188.

At step 4514, for each band-pixel value of the redundant-informationimage 132, AOU_(ij) transfers it according to the function Λ′_(ij1)(x),by communicating with neighbor array operation units 100. Thetransferred band-pixel value is regarded as a band-pixel value of a newredundant-information image 132.

At step 4515, AOU_(ij) judges whether the degeneration timesrepresenting the repeat times from step 4508 to step 4514 achieve thedirected times or not. If the degeneration times do not achieve thedirected times (step 4515: NO), this algorithm returns to step 4508. Ifthe degeneration times achieve the directed times (step 4515: YES), thisalgorithm goes to step 4516. Note that the directed times are derived bythe size of the formed edge-information image 115, the size of theobject represented by the formed edge information 115, and the number ofneighbors q. In a case that some parameters are set to specific numberscorresponding to the aim of use, there is no problem even though thedirected times are set to more than the necessary times. If the directedtimes are too much, however, AOU_(ij) takes much time to detect theposition, the size and the form of the object.

At step 4516, AOU_(ij) outputs a band-pixel value of theredundant-information image 132 and each band-pixel value of thetransfer-source inclination-redundant-information image 188. Thisalgorithm then returns to step 4503.

Note that each redundant information 131 of the redundant-informationimage 132 consequently means the size of the object, whose center is aposition of the redundant-information image 132, because it means thetotal number of the formed edge information 114 around the position. Inaddition, almost all transfer-source inclination-redundant information187 gathers at one place with the redundant information 131, because thetransfer-source inclination-redundant information 187 exists at thepixel which has the redundant information 131. Moreover, sum oftransfer-source inclination-redundant information 187 at a center ofeach of domains of inclination angles θ of line segments almost coincidewith the size of the object.

The position/size/form detection means 45 can generate theredundant-information image 132 and the transfer-sourceinclination-redundant-information image 188 from the formededge-information image 115, by using the data processing device 110consisting of array operation units 100. Note that the functionΔ′_(ij1)(x) and the function Δ″_(ij1)(x) can be used alternately in step4512 if an approximate position of a center of gravity of an objectrepresented by the redundant-information image 132 shifts much from areal position of the center of gravity. Similarly, the functionΛ′**_(ijk)(x, y) and the function Λ″**_(ijk)(x, y) can be usedalternately in step 4513, and the function Λ′_(ij1)(x) and the functionΛ′_(ij1)(x) can be used alternately in step 4514.

Suppose here that an inclination angle θ is segmented into four domainsof 0 degree (0 radian), 45 degrees (π/4 radian), 90 degrees (π/2 radian)and 135 degrees (3π/4 radian), according to EQ.54. In short, theinclination angle θ represents a normal angle of a line segmentrepresented by a formed edge-information image 115. It is explained hereabout a method generating a form-size-information image 190 from atransfer-source inclination-redundant-information image 188, referringto this example.

First, suppose that a 36-band grayscale image x is the transfer-sourceinclination-redundant-information image 188. The image x is divided intofour images every 9 bands, and they are the transfer-sourceredundant-information images 184 corresponding to line segments of theinclination angles θ segmented into 0 degree, 45 degrees, 90 degrees and135 degrees, respectively. Here, transfer direction of the line segmentsθ*_(i,j,k+1)(x) is derived, by transforming EQ.52 into EQ.67. Note thatk denotes the domain of 0 degree if k=0, k denotes the domain of 45degree if k=1, k denotes the domain of 90 degree if k=2, and k denotesthe domain of 135 degree if k=3. $\begin{matrix}{{\theta_{i,j,{k + 1}}^{*}(x)} = \left\{ \begin{matrix}0 & {{{{if}\quad x_{i,j,{{9k} + 2}}} + x_{i,j,{{9k} + 6}}} = 0} \\\quad & {{{{{and}\quad x_{i,k,{{9k} + 4}}} + x_{i,j,{{9k} + 8}}} = 0},} \\{{\arctan\left( \frac{\quad{x_{i,j,{{9k} + 2}} + x_{i,j,{{9k} + 6}}}}{x_{i,j,{{9k} + 4}} + x_{i,j,{{9k} + 8}}} \right)} - \frac{\pi}{4}} & {{{{if}\quad x_{i,j,{{9k} + 1}}} + x_{i,j,{{9k} + 5}}} \geq {x_{i,j,{{9k} + 3}} + x_{i,j,{{9k} + 7}}}} \\\quad & {{{{and}\quad x_{i,j,{{9k} + 2}}} + x_{i,j,{{9k} + 6}}} \geq {x_{i,j,{{9k} + 4}} + x_{i,j,{{9k} + 8}}}} \\\quad & {{{{except}\quad x_{i,j,{{9k} + 2}}} + x_{i,j,{{9k} + 6}}} = 0} \\\quad & {{{{{and}\quad x_{i,j,{{9k} + 4}}} + x_{i,j,{{9k} + 8}}} = 0},} \\{{\arctan\left( \frac{\quad{x_{i,j,{{9k} + 2}} + x_{i,j,{{9k} + 6}}}}{x_{i,j,{{9k} + 4}} + x_{i,j,{{9k} + 8}}} \right)} + \frac{3\quad\pi}{4}} & {{{{if}\quad x_{i,j,{{9k} + 1}}} + x_{i,j,{{9k} + 5}}} \geq {x_{i,j,{{9k} + 3}} + x_{i,j,{{9k} + 7}}}} \\\quad & {{{{{and}\quad x_{i,j,{{9k} + 2}}} + x_{i,j,{{9k} + 6}}} < {x_{i,j,{{9k} + 4}} + x_{i,j,{{9k} + 8}}}},} \\{{\arctan\left( \frac{\quad{x_{i,j,{{9k} + 4}} + x_{i,j,{{9k} + 8}}}}{x_{i,j,{{9k} + 2}} + x_{i,j,{{9k} + 6}}} \right)} + \frac{\pi}{4}} & {{otherwise}.}\end{matrix} \right.} & (67)\end{matrix}$

Of course, if the transfer direction θ*_(i,j,k+1)(x) can be representedby a specific interval, a memory 102 has only to memorize a look-uptable preparing the necessary number of the transfer directions insteadof a table of logarithms.

Suppose here that form χ_(ij1)(x) of an object at a position p(i, j, k)in the 36-band grayscale image x is either a horizontal line segment (0degree), a upward line segment (45 degrees), a vertical line segment (90degrees), a downward line segment (135 degrees), a cross (0 degree), anX (45 degrees), a star (a combination of the cross and the X), a upwardtriangle, a downward triangle, a leftward triangle, a rightwardtriangle, a rectangle, a rhombus (90 degrees), a circle or other, andnumbers of 1 to 15 are assigned to them, respectively. The formχ_(ij1)(x) of the object is calculated, according to EQ.68 and EQ.69.Note that the number of bands is one, for convenience' sake.$\begin{matrix}{{\chi_{{ij}\quad 1}(x)} = \left\{ \begin{matrix}1 & {{{{if}\quad x_{i,j,9}} > 0},{{2\quad x_{i,j,18}} < {x_{i,j,9,}2\quad x_{i,j,27}} < {x_{i,j,9,}2\quad x_{i,j,36}} < x_{i,j,9}},} \\2 & {{{{{if}\quad 2x_{i,j,9}} < x_{i,j,18}},{x_{i,j,18} > 0},{{2\quad x_{i,j,27}} < {x_{i,j,18,}2\quad x_{i,j,36}} < x_{i,j,18}},}\quad} \\3 & {{{{if}\quad 2x_{i,j,9}} < x_{i,j,27}},{{2x_{i,j,18}} < \quad x_{i,j,27}},{x_{i,j,27} > 0},{{2\quad x_{i,j,36}} < x_{i,j,27}},} \\4 & {{{{if}\quad 2x_{i,j,9}} < x_{i,j,36}},{{2x_{i,j,18}} < x_{i,j,36}},{{2\quad x_{i,j,27}} < x_{i,j,36}},{x_{i,j,36} > 0},} \\5 & {{{{if}\quad 2x_{i,j,18}} < {\min\quad\left( {x_{i,j,9},x_{i,j,27}} \right)}},{{2\quad x_{i,j,36}} < {\min\left( {x_{i,j,9},x_{i,j,27}} \right)}},} \\\quad & {{x_{i,j,9} > 0},{x_{i,j,27} > 0},{0 \leq \theta_{{ij}\quad 1}^{*} < \frac{\pi}{4}},{\frac{3\quad\pi}{4} \leq \theta_{{ij}\quad 1}^{*} < \pi},{\frac{\pi}{4} \leq \theta_{{ij}\quad 3}^{*} < \frac{3\quad\pi}{4}},} \\6 & {{{{if}\quad 2\quad x_{i,j,9}} < {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,18} > 0},} \\\quad & {{{2\quad x_{i,j,27}} < {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,36} > 0},{0 \leq \theta_{{ij}\quad 2}^{*} < \frac{\pi}{2}},{\frac{\pi}{2} \leq \theta_{{ij}\quad 4}^{*} < \pi},} \\7 & {{{{if}\quad 2\quad x_{i,j,18}} > {\min\left( {x_{i,j,9},x_{i,j,27}} \right)}},{{2\quad x_{i,j,36}} > {\min\left( {x_{i,j,9},x_{i,j,27}} \right)}},} \\\quad & {{x_{i,j,9} > 0},{x_{i,j,27} > 0},{0 \leq \theta_{{ij}\quad 1}^{*} < {\frac{\pi}{4}\quad{or}\quad\frac{3\quad\pi}{4}} \leq \theta_{{ij}\quad 1}^{*} < \pi},{0 \leq \theta_{{ij}\quad 2}^{*} < \frac{\pi}{2}},} \\\quad & {{\frac{\pi}{4} \leq \theta_{{ij}\quad 3}^{*} < \frac{3\quad\pi}{4}},{\frac{\pi}{4} \leq \theta_{{ij}\quad 4}^{*} < \frac{3\quad\pi}{4}},} \\\quad & {{{{or}\quad{if}\quad 2\quad x_{i,j,9}} > {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,18} > 0},} \\\quad & {{{2\quad x_{i,j,27}} > {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,36} > 0},{0 \leq \theta_{{ij}\quad 1}^{*} < {\frac{\pi}{4}\quad{or}}}} \\\quad & {{\frac{3\quad\pi}{4} \leq \theta_{{ij}\quad 1}^{*} < \pi},{0 \leq \theta_{{ij}\quad 2}^{*} < \frac{\pi}{2}},{\frac{\pi}{4} \leq \theta_{{ij}\quad 3}^{*} < \frac{3\quad\pi}{4}},{\frac{\pi}{4} \leq \theta_{{ij}\quad 4}^{*} < {\frac{3\quad\pi}{4}.}}}\end{matrix} \right.} & (68) \\{{\chi_{{ij}\quad 1}(x)} = \left\{ \begin{matrix}8 & {{{{if}\quad x_{i,j,9}} > 0},{x_{i,j,18} > 0},{{2\quad x_{i,j,27}} < {\min\left( {x_{i,j,9},x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,36} > 0},} \\\quad & {{{x_{i,j,10} + x_{i,j,11} + x_{i,j,17}} < {x_{i,j,13} + x_{i,j,14} + x_{i,j,15}}},} \\\quad & {{{x_{i,j,28} + x_{i,j,29} + x_{i,j,35}} > {x_{i,j,31} + x_{i,j,32} + x_{i,j,33}}},} \\\quad & {{{0 \leq \theta_{{ij}\quad 2}^{*} < {\frac{\pi}{4}\quad{or}\quad\frac{3\quad\pi}{4}} \leq \theta_{{ij}\quad 2}^{*} < \pi},{0 \leq \theta_{{ij}\quad 4}^{*} < {\frac{\pi}{4}\quad{or}\quad\frac{3\quad\pi}{4}} \leq \theta_{{ij}\quad 4}^{*} < \pi},}\quad} \\9 & {{{{if}\quad x_{i,j,9}} > 0},{x_{i,j,18} > 0},{{2\quad x_{i,j,27}} < {\min\left( {x_{i,j,9},x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,36} > 0},} \\\quad & {{{x_{i,j,10} + x_{i,j,11} + x_{i,j,17}} > {x_{i,j,13} + x_{i,j,14} + x_{i,j,15}}},} \\\quad & {{{x_{i,j,28} + x_{i,j,29} + x_{i,j,35}} < {x_{i,j,31} + x_{i,j,32} + x_{i,j,33}}},} \\\quad & {{0 \leq \theta_{{ij}\quad 2}^{*} < {\frac{\pi}{4}\quad{or}\quad\frac{3\quad\pi}{4}} \leq \theta_{{ij}\quad 2}^{*} < \pi},{0 \leq \theta_{{ij}\quad 4}^{*} < {\frac{\pi}{4}\quad{or}\quad\frac{3\quad\pi}{4}} \leq \theta_{{ij}\quad 4}^{*} < \pi},} \\10 & {{{{if}\quad 2\quad x_{i,j,9}} < {\min\left( {x_{i,j,18},x_{i,j,27},x_{i,j,36}} \right)}},{x_{i,j,18} > 0},{x_{i,j,27} > 0},{x_{i,j,36} > 0},} \\\quad & {{{x_{i,j,11} + x_{i,j,12} + x_{i,j,13}} < {x_{i,j,15} + x_{i,j,16} + x_{i,j,17}}},} \\\quad & {{{x_{i,j,29} + x_{i,j,30} + x_{i,j,31}} > {x_{i,j,33} + x_{i,j,34} + x_{i,j,35}}},} \\\quad & {{\frac{\pi}{4} \leq \theta_{{ij}\quad 2}^{*} < \frac{3\quad\pi}{4}},{\frac{\pi}{4} \leq \theta_{{ij}\quad 4}^{*} < \frac{3\quad\pi}{4}},} \\11 & {{{{if}\quad 2\quad x_{i,j,9}} < {\min\left( {x_{i,j,18},x_{i,j,27},x_{i,j,36}} \right)}},{x_{i,j,18} > 0},{x_{i,j,27} > 0},{x_{i,j,36} > 0},} \\\quad & {{{x_{i,j,11} + x_{i,j,12} + x_{i,j,13}} > {x_{i,j,15} + x_{i,j,16} + x_{i,j,17}}},} \\\quad & {{{x_{i,j,29} + x_{i,j,30} + x_{i,j,31}} < {x_{i,j,33} + x_{i,j,34} + x_{i,j,35}}},} \\\quad & {{\frac{\pi}{4} \leq \theta_{{ij}\quad 2}^{*} < \frac{3\quad\pi}{4}},{\frac{\pi}{4} \leq \theta_{{ij}\quad 4}^{*} < \frac{3\quad\pi}{4}},} \\12 & {{{{if}\quad 2\quad x_{i,j,18}} < {\min\left( {x_{i,j,9},x_{i,j,27}} \right)}},{{2\quad x_{i,j,36}} < {\min\left( {x_{i,j,9},x_{i,j,27}} \right)}},} \\\quad & {{x_{i,j,9} > 0},{x_{i,j,27} > 0},{\frac{1\quad\pi}{4} \leq \theta_{{ij}\quad 1}^{*} < \frac{3\quad\pi}{4}},{0 \leq \theta_{{ij}\quad 3}^{*} < {\frac{\pi}{4}\quad{or}\quad\frac{3\quad\pi}{4}} \leq \theta_{{ij}\quad 3}^{*} < \pi},} \\13 & {{{{if}\quad 2\quad x_{i,j,9}} < {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},{{2\quad x_{i,j,27}} < {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},} \\\quad & {{x_{i,j,18} > 0},{x_{i,j,36} > 0},{\frac{\pi}{2} \leq \theta_{{ij}\quad 2}^{*} < \pi},{0 \leq \theta_{{ij}\quad 4}^{*} < \frac{\pi}{2}},} \\14 & {{{{if}\quad 2\quad x_{i,j,18}} > {\min\left( {x_{i,j,9},x_{i,j,27}} \right)}},{{2\quad x_{i,j,36}} > {\min\left( {x_{i,j,9},x_{i,j,27}} \right)}},} \\\quad & {{x_{i,j,9} > 0},{x_{i,j,27} > 0},{\frac{\pi}{4} \leq \theta_{{ij}\quad 1}^{*} < \frac{3\quad\pi}{4}},{0 \leq \theta_{{ij}\quad 3}^{*} < {\frac{\pi}{4}\quad{or}\quad\frac{3\quad\pi}{4}} \leq \theta_{{ij}\quad 3}^{*} < \pi},} \\\quad & {{{{or}\quad{if}\quad 2\quad x_{i,j,9}} > {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,18} > 0},} \\\quad & {{{2\quad x_{i,j,27}} > {\min\left( {x_{i,j,18},x_{i,j,36}} \right)}},{x_{i,j,36} > 0},{\frac{\pi}{2} \leq \theta_{{ij}\quad 2}^{*} < \pi},{0 \leq \theta_{{ij}\quad 4}^{*} < \frac{\pi}{2}},} \\15 & {{otherwise}.}\end{matrix} \right.} & (69)\end{matrix}$

Of course, EQ.68 and EQ.69 can change conditions, according to accuracy.In addition, if the conditions are subdivided in EQ.68 and EQ.69 moreand more, EQ.68 and EQ.69 can also discriminate form of distortedobjects and form of objects in a noisy image. Moreover, a neural networklike a Perceptron can be used instead of EQ.68 and EQ.69. On the otherhand, if EQ.67 outputs either one of 0 degree (0 radian), 45 degrees(π/2 radian), 90 degrees (π/2 radian) and 135 degrees (3π/4 radian), byusing EQ.53, conditional equations of EQ.68 and EQ.69 become simpler.

Since each of array operation units 100 in a position/size/formdetection means 45 generates form-size information 189, combining formχ_(ijk)(x) of objects and redundant information 131 on the column i andthe row j of a redundant-information image 132, the position/size/formdetection means 45 can output a 15-band form-size-information image 190,each of whose band-pixel values represents size of the correspondingfigure (refer to FIG. 45). Of course, the position/size/form detectionmeans 45 can also output a two-band form-size-information image 190, oneof whose band-pixel values represents a number of figure, and anotherband-pixel value represents size of the figure.

Now, by combining a position/size/inclination detection means 44 and aposition/size/form detection means 45, a visual device 2 can detect formof an object from a formed edge-information image 115. It is explainedhere about a geometrical analysis means 37 which is a combination of theposition/size/inclination detection means 44 and the position/size/formdetection means 45.

First, as shown in FIG. 43, a geometrical analysis means 37 consists ofa position/size/inclination detection means 44 and a position/size/formdetection means 45. In addition, the position/size/inclination detectionmeans 44 inputs a formed edge-information image 115 consisting of formededge information 114 representing whether there are edges of objects ornot, and outputs an inclination-size-information image 186 consisting ofinclination-size information 185. Moreover, the position/size/formdetection means 45 inputs the formed edge-information image 115 and theinclination-size-information image 186, and outputs a transfer-sourceinclination-redundant-information image 188 consisting oftransfer-source inclination-redundant information 187. For example, inFIG. 43, the geometrical analysis means 37 detects some line segmentsleaning at 0 degree, 45 degrees and 135 degrees against a horizontalaxis from a formed edge-information image 115 representing contours of atriangle. Note that, as shown in FIG. 44, the geometrical analysis means37 can detect form of a triangle even though the formed edge-informationimage 115 represents contours of the triangle by dash lines. This can beguessed easily from a feature that the position/size/inclinationdetection means 44 hashes at least one line segment constructing afigure.

Next, as shown in FIG. 45, the geometrical analysis means 37 candirectly output a form-size-information image 190 consisting ofform-size information representing a discrimination result of form of anobject in a formed edge-information image 115. In this case, althoughthe position/size/form detection means 45 needs a method discriminatingthe form of the object from a transfer-sourceinclination-redundant-information image 188, the amount of data of thediscrimination results outputted by the geometrical analysis means 37becomes a much more little than the transfer-sourceinclination-redundant-information image 188. Note that aform-size-information image 190 can be a two-band image consisting of aband representing the form and a band representing size although FIG. 45shows the form-size-information image 190 as all forms are arranged in adifferent band.

Finally, as shown in FIG. 46, the geometrical analysis means 37 candetect position, size and form of each figure, for a pattern consistingof some figures like a facial pattern. In addition, as shown in FIG. 47,the geometrical analysis means 37 can also detect form and size offigures within each minute area, by dividing texture into some minuteareas.

It has been described above about a case that the geometrical analysismeans 37 uses the formed edge-information image 115. However, if theimage is a one-band image whose line width is about two or three pixels,the image can be generated in anyway.

As shown in FIG. 48, in order for the area normalization means 27realized by a data processing device 110 to generate a normalized image145 including a normalized area 144 from an object-area image 142including an object area 141 and a digital image 111, array operationunits 100 arranged in the shape of a lattice work synchronously inparallel. Let an array operation unit 100 at a column i and a row j of amatrix be AOU_(ij). Algorithm of AOU_(ij) is shown in FIG. 49.

At step 2701, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 2702, neighbors of AOU_(ij) are set and its parameters areinitialized. In setting the neighbors, the number of neighbors used inthe above functions can be defined as either four or eight individually,or all of them can be defined as either four or eight uniformly. Inorder to make the normalized image 145 generated by the areanormalization means 27 of the present invention more exact, the numberof neighbors q has to be set a large number for all functions. The areanormalization means 27, however, can cope with limitation ofcomputational time to normalize a segmented object area 143 and the sizeof the input digital image 111, by varying the number of neighborssuitably.

At step 2703, AOU_(ij) judges whether there is both an object-area image142 and a digital image 111 inputted one by one or not. If there is notthe object-area image 142 or the digital images 111 any more (step 2703:YES), this algorithm ends. If there is either the object-area image 142or the digital image 111 (step 2703: NO), this algorithm goes to step2704. Note that this algorithm can be an infinite loop when arrayoperation units 100 are realized for a specific size of the image.

At step 2704, AOU_(ij) inputs one band of a pixel on the column i andthe row j of the object-area image 142 and the whole pixel on the columni and the row j of the digital image 111. This is done for AOU_(ij) toprocess collectively the pixel on the column i and the row j of theobject-area image 142 and the pixel on the column i and the row j of thedigital image 111. Therefore, AOU_(ij) needs a memory 102 memorizing atleast the number of total bands of image data.

At step 2705, AOU_(ij) separates the pixel on the column i and the row jof the object-area image 142 and the pixel on the column i and the row jof the digital image 111. This is done for AOU_(ij) to process the pixelon the column i and the row j of the object-area image 142 and the pixelon the column i and the row j of the digital image 111 as two pixel ofindependent images, respectively. If the pixel on the column i and therow j of the object-area image 142 and the pixel on the column i and therow j of the digital image 111 are separated beforehand, followed bybeing inputted, AOU_(ij) carries out nothing. The object-area image 142and the digital image 111 can be copied an updated object-area image andan updated digital image, respectively.

At step 2706, for each band-pixel value of the updated object-areaimage, AOU_(ij) calculates a transfer value, according to the functionR_(ij1)(x), by communicating with neighbor array operation units 100.The band-pixel value representing the transfer value is regarded as aband-pixel value of a transfer-value image.

At step 2707, for each band-pixel value of the updated object-areaimage, AOU_(ij) can find a transfer-place band-pixel value possible totransfer according to the function H_(ijk)(x, y), by communicating withneighbor array operation units 100. The value representing whether thetransfer-place band-pixel value is a transfer place possible to transferor not is regarded as a band-pixel value of a transferable image.

At step 2708, for each band-pixel value of the updated object-areaimage, AOU_(ij) transfers it to the transfer place according to thefunction U_(ijk)(x, y), by communicating with neighbor array operationunits 100. The transferred band-pixel value is regarded as a band-pixelvalue of a new updated object-area image.

At step 2709, for each band-pixel value of the updated digital image,AOU_(ij) transfers it to the transfer place according to the functionU_(ijk)(x, y), by communicating with neighbor array operation units 100.The transferred band-pixel value is regarded as a band-pixel value of anew updated digital image.

At step 2710, AOU_(ij) judges whether the transfer times representingthe repeat times from step 2706 to step 2709 achieve the directed timesor not. If the transfer times do not achieve the directed times (step2710: NO), this algorithm returns to step 2706. If the transfer timesachieve the directed times (step 2710: YES), this algorithm goes to step2711. Note that the directed times are derived by the size of thedigital image 111, the size of the segmented object area 143 of thedigital image 111, and the number of neighbors q. In a case that someparameters are set to specific numbers corresponding to the aim of use,there is no problem even though the directed times are set to more thanthe necessary times. If the directed times are too much, however,AOU_(ij) takes much time to normalize the images.

At step 2711, for each band-pixel value of the updated object-area imagewhich has been finished transferring, AOU_(ij) complements it with theaverage of its neighbors according to the function V_(ijk)(x, y), bycommunicating with neighbor array operation units 100. Note that both xand y are dealt as the updated object-area image. The complementedband-pixel value is regarded as a band-pixel value of a normalizedupdated object-area image.

At step 2712, for each band-pixel value of the updated digital imagewhich has been finished transferring, AOU_(ij) complements it with theaverage of its neighbors according to the function V_(ijk)(x, y), bycommunicating with neighbor array operation units 100. Note that x isdealt as the updated digital image, and y is dealt as the updatedobject-area image. The transferred band-pixel value is regarded as aband-pixel value of a normalized digital image.

At step 2713, AOU_(ij) judges whether the transfer times representingthe complement times from step 2711 to step 2712 achieve the directedtimes or not. If the complement times do not achieve the directed times(step 2713: NO), this algorithm returns to step 2711. If the complementtimes achieve the directed times (step 2713: YES), this algorithm goesto step 2714. In general, there is no problem if the complement timesare about half of the number of neighbors q.

At step 2714, AOU_(ij) judges whether the remain times representing therepeat times from step 2706 to step 2713 achieve the directed times ornot. If the remain times do not achieve the directed times (step 2714:NO), this algorithm returns to step 2706. If the remain times achievethe directed times (step 2714: YES), this algorithm goes to step 2715.Note that the directed times are derived by the size of the digitalimage 111, the size of the segmented object area 143 of the digitalimage 111, and the number of neighbors q. In a case that some parametersare set to specific numbers corresponding to the aim of use, there is noproblem even though the directed times are set to more than thenecessary times. If the directed times are too much, however, AOU_(ij)takes much time to normalize the images.

At step 2715, AOU_(ij) outputs a band-pixel value of the updated digitalimage as a band-pixel value of the normalized image 145. This algorithmthen returns to step 2703.

The area normalization means 27 can generate the normalized image 145from the object-area image 142 and the digital image 111, by using thedata processing device 110 consisting of array operation units 100.

Here, in a case that a pixel comprises independent information like aform-size-information image 190, an area normalization means 27 does nothave to complement between the pixels. In this case, as shown in FIG.50, the area normalization means 27 can omit step 2710, 2711, 2712 and2713. In short, the area normalization means 27 does not have to carryout the function V_(ijk)(x, y). Therefore, when the array operation unit100 is realized by a hardware, a division circuit can be omitted. Notethat a method using a normalized image 145 normalized from a segmentedobject area 143 as before is also useful for pattern matching of aneyeball pattern and a striped pattern.

As shown in FIG. 51, in order for the mask means 40 realized by a dataprocessing device 110 to generate a masked image 148 from a digitalimage 111 and an object-area image 142, array operation units 100arranged in the shape of a lattice work synchronously in parallel. Letan array operation unit 100 at a column i and a row j of a matrix beAOU_(ij). Algorithm of AOU_(ij) is shown in FIG. 52.

At step 4001, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 4002, neighbors of AOU_(ij) are set and its parameters areinitialized.

At step 4003, AOU_(ij) judges whether there are both a digital image 111and an object-area image 142 inputted one by one or not. If there is notthe digital image 111 or the object-area image 142 any more (step 4003:YES), this algorithm ends. If there is either the digital image 111 orthe object-area image 142 (step 4003: NO), this algorithm goes to step4004. Note that this algorithm can be an infinite loop when arrayoperation units 100 are realized for a specific size of the image.

At step 4004, AOU_(ij) inputs the whole pixel on the column i and therow j of the digital image 111 and the whole pixel on the column i andthe row j of the object-area image 142. This is done for AOU_(ij) toprocess collectively the pixel on the column i and the row j of thedigital image 111 and the pixel on the column i and the row j of theobject-area image 142. Therefore, AOU_(ij) needs a memory 102 memorizingat least the number of bands of image data.

At step 4005, for each band-pixel value of the digital image 111,AOU_(ij) carries out mask processing, according to the functionO_(ijk)(x,y). The masked band-pixel value is regarded as a band-pixelvalue of a masked image 148.

At step 4006, AOU_(ij) outputs the band-pixel value of the masked image148. This algorithm then returns to step 4003.

The mask means 40 can mask the digital image 111 except a segmentedobject area 143, by using the data processing device 110 consisting ofarray operation units 100.

In order for the image keeping means 39 realized by a data processingdevice 110 to memorize a normalized image 145, array operation units 100arranged in the shape of a lattice work synchronously in parallel. Letan array operation unit 100 at a column i and a row j of a matrix beAOU_(ij). Algorithm of AOU_(ij) is shown in FIG. 53.

At step 3801, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 3802, neighbors of AOU_(ij) are set and its parameters areinitialized.

At step 3803, AOU_(ij) judges whether there is a normalized image 145inputted one by one or not. If there is not the normalized image 145 anymore (step 3803: YES), this algorithm ends. If there is the normalizedimage 145 (step 3803: NO), this algorithm goes to step 3804. Note thatthis algorithm can be an infinite loop when array operation units 100are realized for a specific size of the image.

At step 3804, AOU_(ij) inputs the whole pixel on the column i and therow j of the normalized image 145. Therefore, AOU_(ij) needs a memory102 memorizing at least the number of bands of image data.

At step 3805, AOU_(ij) changes the format of the normalized image 145 ifdesired, for a device of an output place. This is useful for the deviceto generate analog signals easily, especially by converting thenormalized image 145 to any one-band image, or converting the normalizedimage 145, the number of whose bands is four or more, to any three-bandimage. Otherwise, AOU_(ij) does nothing.

At step 3806, AOU_(ij) memorizes a pixel on the column i and the row jof the normalized image 145, as it can certainly send image data to thedevices of the output place, which has the different computational powerfrom it.

At step 3807, AOU_(ij) outputs a band-pixel value of the normalizedimage 145. This algorithm then returns to step 3803.

The image keeping means 39 can output the normalized image 145, by usingthe data processing device 110 consisting of array operation units 100.Note that the image keeping means 39 which keeps the digital image 111or the masked image 148 also carries out this algorithms similarly.

Now, the image memorization means 12, the color-information generationmeans 41, the edge-information generation means 14, the edge-informationformation means 15, the position/size detection means 17, theposition/size/inclination detection means 44, the area normalizationmeans 27, the mask means 40 and the image keeping means 39 have beendescribed above. Note that they carry out image processing consisting ofonly neighbor processing after the data processing device 110 inputtedone or two image. The pattern matching means 38, however, must use verymany images. It is explained here about a method realizing the patternmatching means 38 in the data processing device 110, showing neighborprocessing used in the pattern matching means 38.

Suppose first that an image is denoted as x, and n template images 146as y¹, y² , , , y^(h) , , , y^(n). For a natural number g, a matchingresult δ_(ij1) for a pixel on the column i and the row j of amatching-result image 147 represents a number of template image 146which has the most similar pixel as the pixel of the normalized image145 after comparing the pixels on the column i and the row j of theimage x and the template image 146. Note that the number of bands of thematching-result image 147 is dealt with one, for convenience' sake,because the matching-result image 147 becomes a one-band image. Thethird index of the matching result δ_(ij1) is then equal to one. Inaddition, in a case of q=0, q neighbors have no pixels. $\begin{matrix}{\delta_{{ij}\quad 1} = \left\{ \begin{matrix}g & {{{if}\quad{\sum_{k}\left( {x_{ijk} - y_{lmk}^{g}} \right)^{2}}} = {\min_{1 \leq h \leq n}{\sum_{k}\left( {x_{ijk} - y_{stk}^{h}} \right)^{2}}}} \\\quad & {{{{for}\quad 1} \leq g \leq {n\quad{and}\quad{only}\quad{one}\quad g}},} \\\quad & {{{and}\quad{\forall{{p\left( {s,t,k} \right)} \in \left\{ {{p\left( {i,j,k} \right)},{P_{i,j,k}(q)}} \right\}}}},} \\\quad & {{{{and}\quad{only}\quad{one}\quad{p\left( {l,m,k} \right)}} \in \left\{ {{p\left( {i,j,k} \right)},{P_{i,j,k}(q)}} \right\}},} \\0 & {{otherwise}.}\end{matrix} \right.} & (70)\end{matrix}$

As shown in FIG. 54, in order for pattern matching realized by a dataprocessing device 110 to generate a matching-result image 147 consistingof matching results representing a number of a template image 146 whichis most similar to a normalized image 145, array operation units 100arranged in the shape of a lattice work synchronously in parallel. Letan array operation unit 100 at a column i and a row j of a matrix beAOU_(ij). Algorithm of AOU_(ij) is shown in FIG. 55.

At step 2901, AOU_(ij) is arranged at the column i and the row j of thematrix. This is desired to decide neighbors of AOU_(ij) even though theAOU_(ij) is either logical or physical.

At step 2902, neighbors of AOU_(ij) are set and its parameters areinitialized. In setting the neighbors, the number of neighbors q used inthe above functions can be defined individually, or all of them can bedefined uniformly. In order to make the matching-result image 147generated by the data processing device 110 of the present inventionmore exact, the number of neighbors q has to be set a large number forall functions. The pattern matching, however, can cope with limitationof computational time to update the matching results and the size of theinput normalized image 145, by varying the number of neighbors suitably.Note that, in this step, a pixel on the column i and the row j of sometemplate images 146 prepared beforehand and all pixels at its qneighbors are also initialized.

At step 2903, AOU_(ij) judges whether there is a template image 146inputted one by one or not. If there is not the template images 146 anymore (step 2903: YES), this algorithm goes to step 2905. If there is thetemplate image 146 (step 2903: NO), this algorithm goes to step 2904.Note that this algorithm can be an infinite loop when array operationunits 100 are realized for a specific size of the image.

At step 2904, AOU_(ij) inputs the whole pixel on the column i and therow j of the input image. Therefore, AOU_(ij) needs a memory 102memorizing image data whose number is equal to at least the number ofbands by the number of template image 146.

At step 2905, AOU_(ij) computes the matching result δ_(ij1) of thematching-result image 147 by the input image and the template image 146.The matching result is a band-pixel value representing number of themost similar template image 146 to the input image.

At step 2906, AOU_(ij) outputs a band-pixel value of the matching-resultimage 147. This algorithm then returns to step 2903.

Pattern matching in the image recognition means 29 can generate thematching-result image 147 from the input image, by using the dataprocessing device 110 consisting of array operation units 100. Note thatthe necessary local processing is carried out after step 2906, in a casethat the input image is appended to the template images 146.

It has been described above about methods carrying out image processingwhich uses only neighbor processing, using a data processing device 110consisting of array operation units 100. It is explained here about thefigure/ground separation means 16 by only neighbor processing, using adata processing device 110 consisting of array operation units 100.

First, nonlinear oscillators generally presents attraction phenomenon.This attraction phenomenon is phenomenon limited as some nonlinearoscillators representing different cycles vibrate in cycles, which showa simple constant ration, because of interaction. When oscillation ofone nonlinear oscillator is changed, other nonlinear oscillators changetheir oscillation together. These nonlinear oscillators, therefore, aresynchronizing. In addition, the adjusted interaction among the nonlinearoscillators can cause making the difference of phases of any twooscillators as small or big as possible. Controlling the interaction, agroup of nonlinear oscillators can be divided into some groups whoseoscillators represent different phases. The figure/ground separationmeans 16 separates objects and background by using such attraction ofoscillators, as edge information of an edge-information image becomesthe border. The figure/ground separation means 16 then generates anobject-area image 142 representing an object area 141. A case that a vander Pole oscillator is used for the nonlinear oscillator is describedhere.

First, in a nonlinear oscillator network consisting of nonlinearoscillators arranged in the shape of a lattice, let a nonlinearoscillator on the column i and the row j be ω_(ij). A set Ω_(ij)(q) of qneighbors of the nonlinear oscillator ω_(ij) is represented by EQ.71,where q is a progression of 4, 8, 24, 48, 80, 120, (2r+1)²−1, and r is anatural number. When a nonlinear oscillator outside of the network isincluded in the neighbor set Ω_(ij)(q), it is superseded by thenonlinear oscillator ω_(ij). Processing around the border isautomatically carried out by this replacement. Then, the number ofelements of the neighbor set Ω_(ij)(q) is always q. As this showing, thenonlinear oscillator network is regarded as a one-band image. In orderto describe simply, there are only two indexes of the nonlinearoscillator network, which represent horizontal axis and vertical axis.$\begin{matrix}{{\Omega_{ij}(q)} = \left\{ \begin{matrix}\left\{ {w_{{i + 1},j},w_{i,{j + 1}},w_{{i - 1},j},w_{i,{j - 1}}} \right\} & {{{{if}\quad q} = 4},} \\\left\{ {\left. w_{l,m} \middle| {{i - r} \leq l \leq {i + r}} \right.,{{j - r} \leq m \leq {j + r}},{w_{l,m} \neq w_{i,j}}} \right\} & {{{if}\quad q} = {\left( {{2\quad r} + 1} \right)^{2} - 1.}}\end{matrix} \right.} & (71)\end{matrix}$

Next, the nonlinear oscillator is connected by a link value τ_(ijkl)calculated by EQ.72 between it and one of nonlinear oscillators in aneighbor set Ω_(ij)(q_(a)), which is included within its q_(a)neighbors. If you do not use a table of logarithms, you can also useapproximation by EQ.73. Note that μ and υ are positive constants.$\begin{matrix}{T_{ijkl} = {\mu\quad\sin\quad{c\left( \frac{\left( {i - k} \right)^{2} + \left( {j - l} \right)^{2}}{v^{2}} \right)}\quad{for}\quad{\forall{w_{kl} \in {\Omega_{ij}\left( q_{a} \right)}}}}} & (72) \\{{\sin\quad{c(x)}} \approx \left\{ \begin{matrix}{1 - {2{x}^{2}} + {x}^{3}} & {{{{if}\quad 0} \leq {x} < 1},} \\{4 - {8{x}} + {5{x}^{2}} - {x}^{3}} & {{{{if}\quad 1} \leq {x} < 2},} \\0 & {{otherwise}.}\end{matrix} \right.} & (73)\end{matrix}$

Of course, υ is a constant. Therefore, if a reciprocal of υ is used,division in EQ.72 is changed to multiplication. In addition, if the linkvalue τ_(ijkl) takes only a non-negative real number, the functionsinc(x) can be always equal to one.

In a case that all nonlinear oscillators of a nonlinear oscillatornetwork synchronize with the same phase completely, a nonlinearoscillator ω_(ij) remains permanently oscillating with the same phase aslong as a processor calculates the oscillation. This situation can beavoided if an external noise ρ_(ij) is given to the network. Although apseudo-random number can be used for the external noise, a simpleequation like EQ.74 can be also used, by inputting a grayscale imagefrom an external part. Note that ζ′_(ij) represents a band-pixel valueon the column i and the row j of the grayscale image. In addition, κ isa positive constant.ρ_(ij)=κζ_(ij)  (74)

In order for a nonlinear oscillator ω_(ij) to synchronize with anonlinear oscillator ω_(kl) of a neighbor set Ω_(ij)(q_(a)), a neighborinput summation σ_(ij) is calculated by EQ.75. Note that ζ_(ij)represents whether there is edge information on the column i and the rowj of the edge-information image or not. If there is edge information, itis equal to one. Otherwise, it is equal to zero. $\begin{matrix}{\sigma_{ij} = {\sum\limits_{w_{kl} \in {\Omega_{ij}{(q_{a})}}}{{T_{ijkl}\left( {1 - \zeta_{kl}} \right)}{\xi_{kl}\left( {\psi_{kl} - \psi_{ij}} \right)}}}} & (75)\end{matrix}$

Two parameters, φ_(ij) and ψ_(ij), constituting a van der Pole nonlinearoscillator ω_(ij) are calculated by EQ.76 and EQ.77. Note that γ and εare positive constants. $\begin{matrix}{\frac{\mathbb{d}\phi_{ij}}{\mathbb{d}t} = \psi_{ij}} & (76) \\{\frac{\mathbb{d}\psi_{ij}}{\mathbb{d}t} = {{{{- \gamma}\quad\phi_{ij}} -} \in {{\left( {1 - \phi_{ij}^{2}} \right)\psi_{ij}} + \sigma_{ij} + \rho_{ij}}}} & (77)\end{matrix}$

The difference of phases between any two of all nonlinear oscillatorsmust be calculated in order to separate nonlinear oscillators in anobject area 141 from nonlinear oscillators in a background area.However, the phase gap is derived from judging whether a parameterψ_(ij) is more than or equal to threshold value θ, or less than thevalue, because the present invention only has to separate the objectarea 141 from the background area. An output λ_(ij) representing aresult of separating the object area from the background area is derivedby EQ.78. Note that θ is a position constant. $\begin{matrix}{\lambda_{ij} = \left\{ \begin{matrix}1 & {{{{if}\quad\psi_{ij}} \geq \theta},} \\0 & {{otherwise}.}\end{matrix} \right.} & (78)\end{matrix}$

If the edge information is not enough to separate an object frombackground, the edge information must be complemented. It is desired forthe complement to count how many nonlinear oscillators shift theirphases among a set of nonlinear oscillators Ω_(ij)(q_(b)) within q_(b)neighbors of a nonlinear oscillator w_(ij). A contour parameter η_(ij)is computed by EQ.79. $\begin{matrix}{\eta_{ij} = {{\sum\limits_{\omega_{kl} \in {\Omega_{ij}{(q_{b})}}}\quad{\lambda_{ij}\lambda_{kl}}} + \left( \lambda_{ij} \right)^{2}}} & (79)\end{matrix}$

Based on this result, a border parameter ξ_(ij), which represents acomplemental rate for edge information, is computed by EQ.80. Note thatα, β, η_(min) and η_(max) are positive constants. $\begin{matrix}{\frac{\mathbb{d}\xi_{ij}}{\mathbb{d}t} = \left\{ \begin{matrix}{{- \alpha}\quad\xi_{ij}} & {{{{if}\quad\eta_{\min}} \leq \eta_{ij} \leq \eta_{\max}},} \\{\beta\left( {1 - \xi_{ij}} \right)} & {{otherwise}.}\end{matrix} \right.} & (80)\end{matrix}$

Although it has been explained about the case of using van der Pole fora nonlinear oscillator, this separation can be carried out by anynonlinear oscillator presenting attraction phenomenon such as nonlinearoscillators like a blasselator and an integrated-and-fire type ofoscillator stabilized in a limit cycle, and chaos oscillators generatingLorentz Attractor and attractor of Ressler Equation, and so on. In thiscase, two parameters, φ_(ij) and ψ_(ji), only have to be superseded byparameters of each nonlinear oscillator, or some parameters are onlyappended to van der Pole. In addition, we only have to add a neighborinput summation σ_(ij) and an external noise ρ_(ij) to a specificparameter. Note that a chaos oscillator does not need the external noiseρ_(ij) especially.

Algorithm of all array operation units 100 in a data processing device110 which can realize the figure/ground separation means 16 can bedescribed by EQ.71 to EQ.80. It is explained here about thefigure/ground separation means 16, using the algorithm of any arrayoperation unit 100 in the data processing device 110.

As shown in FIG. 56, in order for the figure/ground separation means 16realized by a data processing device 110 to separate an inside area oftriangle 152 from an outside area of triangle 153, by using formedtriangular edge information 151, array operation units 100 arranged inthe shape of a lattice work synchronously in parallel. Let an arrayoperation unit 100 at a column i and a row j of a matrix be AOU_(ij).Algorithm of AOU_(ij) is shown in FIG. 57.

At step 1601, AOU_(ij) is arranged at the column i and the row j of thematrix.

At step 1602, two neighbors, ω_(ij) and ω_(kl), are connected by a linkvalue τ_(ijkl) each other, based on EQ.72 and EQ.73.

At step 1603, two parameters of the nonlinear oscillator, φ_(ij) andψ_(ij), are initialized by specific values.

At step 1604, AOU_(ij) judges whether there is a formed edge-informationimage 115 inputted one by one or not. If there is not the formededge-information image 115 any more (step 1604: YES), this algorithmends. If there is the formed edge-information image 115 (step 1604: NO),this algorithm goes to step 1605. Note that this algorithm can be aninfinite loop when array operation units 100 are realized for a specificnumber of bands and a specific size of the image.

At step 1605, AOU_(ij) inputs the whole pixel on the column i and therow j of the formed edge-information image 115 and aredundant-information image 132. This is done for AOU_(ij) to processcollectively the pixel on the column i and the row j of the formededge-information image 115 and the redundant-information image 132.Therefore, AOU_(ij) needs a memory 102 memorizing at least the number ofbands of image data.

At step 1606, AOU_(ij) separates the pixel on the column i and the row jof the formed edge-information image 115 and the pixel on the column iand the row j of the redundant-information image 132. This is done forAOU_(ij) to process the pixel on the column i and the row j of theformed edge-information image 115 and the pixel on the column i and therow j of the redundant-information image 132, as two pixel ofindependent images, respectively. If the pixel on the column i and therow j of the formed edge-information image 115 and the pixel on thecolumn i and the row j of the redundant-information image 132 areseparated beforehand, followed by being inputted, AOU_(ij) carries outnothing.

At step 1607, AOU_(ij) derives an external noise ρ_(ij) from theredundant information 113 ζ′_(ij) according to EQ.74.

At step 1608, AOU_(ij) inputs ζ_(kl), ξ_(kl), ψ_(kl) from an arrayoperation unit 100 AOU_(kl) which has a nonlinear oscillator ω_(kl) in aneighbor set Ω_(ij)(q_(a)), and calculates a summation σ_(ij) accordingto EQ.75.

At step 1609, two parameters of the nonlinear oscillator, φ_(ij) andψ_(ij) are calculated by EQ.76 and EQ.77. In short, differentialequations described by these equations are solved in Ruge-Kutta method.

At step 1610, an output of the nonlinear oscillator λ_(ij) is computedaccording to EQ.78. λ_(ij)=1 if ψ_(ij)≧θ. Otherwise, λ_(ij)=0.

At step 1611, AOU_(ij) inputs λ_(kl) from an array operation unit 100AOU_(kl) which has a nonlinear oscillator ω_(kl) in a neighbor setΩ_(ij)(q_(b)), and calculates a contour parameter η_(ij) according toEQ.79.

At step 1612, a border parameter ξ_(ij) are calculated by EQ.80. Inshort, a differential equation described by this equation is solved infinite difference method or Ruge-Kutta method.

At step 1613, AOU_(ij) judges whether the separation times representingthe repeat times from step 1608 to step 1612 achieve the directed timesor not. If the separation times do not achieve the directed times (step1613: NO), this algorithm returns to step 1608. If the separation timesachieve the directed times (step 1613: YES), this algorithm goes to step1614.

At step 1614, AOU_(ij) outputs the output of the nonlinear oscillatorλ_(ij), which is a band-pixel value of the object-area image 142. Thisalgorithm then returns to step 1604.

In order to derive the separation time at step 1613, we can use thefollowing method: In the case that almost any formed edge information114, whose size is constant, is used, the figure/ground separation means16 finishes the separation within a specific period, in spite of initialstate of nonlinear oscillators. Therefore, there is no problem if therepeat times from step 1608 to step 1612 in the period are countedbeforehand. Because time which nonlinear oscillators take to synchronizeby attraction phenomenon does not almost vary when their initial statesare within the fixed limits.

Although only nonlinear oscillators are computed, as described above,the reason why the figure/ground separation means 16 can separate theinside area of triangle 152 from the outside area of triangle 153 byusing the formed triangular edge information 151 is to use attractionphenomenon which is character of a nonlinear oscillator. In short,phases of two nonlinear oscillators comes to be as same as possible ifthe nonlinear oscillators are connected by a positive link value. On theother hand, the difference of their phases comes to be as large aspossible if they are connected by a negative link value. In a case ofusing this character, both of two nonlinear oscillators not connectingdirectly come to have the same phase, by connecting nonlinearoscillators arranged in the shape of a lattice with neighbors bypositive link values one another. Suppose, furthermore, that twononlinear oscillators lying at pixels, between which formed edgeinformation 114 is put, are connected by a negative link value each toeach. The oscillators at both sides of the edge information shift theirphases as differently as possible each to each. Because of this, twodifferent phase sets can be present at an inside domain and an outsidedomain divided by triangular edge information 151. The figure/groundseparation means 16, therefore, separates an inside area of triangle 152and an outside area of triangle 153 shown in FIG. 56. Since thedifference of phases of the inside area of triangle 152 and the outsidearea of triangle 153 is as close to 180 degrees as possible, beyond 90degrees, a triangle area and a background area can be separated.

It is important here that a link value is changed on appearance in thefollowing way in this enforcement form, once formed edge information 114is got. As defined in EQ.72 and EQ.73, first, a link value forconnecting a nonlinear oscillator ω_(kl) to a nonlinear oscillatorω_(ij) is set to τ_(ijkl) (refer to step 1602). For both formed edgeinformation 114 ζ_(ij) and ζ_(kl), the formed edge information 114 isset to one if there is an edge. Otherwise, it is set to zero. If theformed edge information 114 ζ_(ij) and ζ_(kl) is inputted (refer to step1605), the formed edge information 114 ζ_(kl) is transmitted from anarray operation unit 100 AOU_(kl) to AOU_(ij). Moreover, AOU_(ij)calculates a link value τ_(ijkl)(1−ζ_(kl)), and substitutes it for alink value τ_(ijkl) (refer to step 1608). For this substituted linkvalue τ_(ijkl)(1−ζ_(kl)) a border parameter ξ_(ij) acts as themagnification between zero and one (refer to step 1608).

As shown in FIG. 58, when formed edge information 114 becomes dashedtriangular edge information 154, a dashed line has to be complemented.Suppose first that a system works, using the dashed triangular edgeinformation 154 (refer to step 1605). Although the difference of phasesbetween an inside area and an outside area divided by dashed triangularedge information 154 comes to be beyond about 90 degrees, an domainaround the border of the inside and outside areas of the triangle is notclear. Each AOU_(ij) calculates an output of its nonlinear oscillatorλ_(ij) (refer to step 1610). Suppose that this output λ_(ij) is equal toone. When a nonlinear oscillator, whose λ_(kl) is equal to one, amongneighbor nonlinear oscillators is ω_(kl), both two parameters, ψ_(ij)and ψ_(kl), are more than or equal to θ. In short, phases of λ_(ij) andλ_(kl) are almost same, and the difference of phases is not beyond atmost 90 degrees if θ is positive. The maximum value of this differenceof phases is decided by θ. Within a range that both λ_(ij) and λ_(kl)are equal to one, the bigger the value θ becomes, the closer to zerodegree the difference of phases becomes. By using λ_(ij) and λ_(kl),then, a contour parameter η_(ij) representing the number of neighbornonlinear oscillators whose phases are almost same are computed by EQ.79(refer to step 1611). Moreover, a border parameter ξ_(ij) which is themagnification of a link value is decreased according to EQ.80 if thiscontour parameter η_(ij) is about half of all neighbors. Otherwise, theborder parameter is increased according to EQ.80 (refer to step 1612).For an example of eight neighbors, the border parameter can be decreasedaccording to EQ.80 if the contour parameter lies between three and five.By remaining carrying out this process repeatedly, an inside area ofdashed triangle 155 and an outside area of dashed triangle 156 areseparated when the dashed triangular edge information 154 shown in FIG.58 is given.

As shown in FIG. 59, edge information of front triangle 157 and edgeinformation of rear triangle 158 can be derived when two triangles arestacked. Three areas, an inside area of front triangle 159, an insidearea of rear triangle 160 and a ground area of double triangle 161, areseparated by shifting phases of nonlinear oscillators in the areas oneanother. As shown in FIG. 60, in addition, an inside area of frontcircle 163, an inside area of rear circle 164 and a ground area ofoverlapping circles 165 are separated even though edge information ofoverlapping circles 162 makes a dashed lined.

Therefore, the figure/ground separation means 16 can separate someobject areas 141 from a background area, whose borders are representedby formed edge information 114 of a formed edge-information image 115,by using the data processing device 110 consisting of array operationunits 100. Note that some separated areas are taken out via an outputλ_(ij) in order with progress of time, but an array operation unit 100can also output these separated areas as some phase groups all at once,by calculating phases of nonlinear oscillators.

It has been mainly described above about algorithms of a visual device2. It is explained here about an architecture of an array operation unit100, especially circuit design of an LSI.

First, the array operation unit 100 generates a pixel of an outputimage, by using a pixel and its neighbor pixels of an input image. Asshown in FIG. 11, the data processing device 110 can generate the outputimage from the input image, when some array operation units 100 arearranged in the shape of a lattice in the data processing device 110,according to the size of the input image. Note that the array operationunit 100 is denoted as AOU in FIG. 11. Next, the array operation unit100 may be implemented by a specialized hardware. Otherwise, it can beimplemented by a software on a general computer, too. That is, if thedata processing device 110 can generate the output image from the inputimage, the implementation way of the array operation unit 100 is notlimited. It is explained here about a case that the array operation unit100 is implemented by the specialized hardware, followed by a case thata virtual array operation unit 105 is implemented by the specializedhardware.

As shown in FIG. 61, an array operation unit 100 consists of a processor101 for computing equations of image processing, a memory 102 formemorizing all parameters, constant values, functions and operators usedin the equations, a controller 103 for communicating with neighbor arrayoperation units 100. The processor 101 can select any memory elementsand registers in the memory 102 and the controller 103, by an addressdirected by address bus 51. The processor 101 is also connectedbidirectionally with the memory 102 and the controller 103 via data bus52, and can access to data in any memory elements and registers directedby address bus 51. Once the controller 103 inputs a front input data setconsisting of one or more input pixels, the processor 101 makes thememory 102 memorize the front input data set. In addition, thecontroller 103 sends a calculation datum calculated by the processor 101to some adjoining array operation units 100, while the processor 101makes the memory 102 to memorize a calculation datum received from someadjoining array operation units 100. If desired, moreover, the processor101 transmits the datum to other adjoining array operation units 100,which does not send the datum. Finally, the controller 103 outputspixels of output images as result data.

The reasons why each array operation unit 100 has the controller 103 asdescribed above are the followings: First, the processor 101 can computeduring waiting communication, that is, it can realize fast processingbecause the processor 101 can work while the array operation units 100are communicating with one another. Second, a hardware of the arrayoperation unit 100 does not have to be changed, even though the numberof its neighbor array operation units 100 varies. Third, a program ofthe processor 101 does not have to carry out border processing of image,that is, exception handling for border pixels in the image. The program,then, becomes extremely simple, since the controller 103 can carry outborder processing automatically.

A block diagram of the controller 103 is shown in FIG. 62. After anaddress buffer 53 receives an address from the processor 101 via addressbus 51, an address decoder 54 selects one of registers and otherfunctional blocks. After a data buffer 55 receives a datum from theprocessor 101 via data bus 52, it exclusively communicates with aregister selected by the address decoder 54 via internal data bus 56,where the direction of communication is directed by READ. When theaddress directed a flag register 57, a datum is memorized in the flagregister 57, followed by being decoded by a flag decoder 58. After that,the datum is sent to some adjoining array operation units 100 asSIGNALS. Note that a detail of the SIGNALS is shown in FIG. 63 and FIG.64. After the SIGNALS are received and analyzed by a flag encoder 59,they are memorized in a status register 60, while they are replied tothe array operation units 100 as a RECEIVE(OUTPUT). The RECEIVE(OUTPUT)is received by the flag encoder 59, which is a sender of the SIGNALS. Asa result, it is checked that transmission of the SIGNALS has completed.Once the status register 60 is selected by an address, contents of thestatus register 60 are sent to the processor 101 via data bus 52,regarding them as data. After the flag encoder 59 received one or moreFRONT INPUT SENDs, corresponding to one or more input images,respectively, front input data sets made from one or more input imagesare read by a front input data register 61, which prepares a memory areanecessary to memorize the sets. After the front input data register 61is selected by an address, contents of the front input data register 61are sent to the processor 101, regarding them as data. Once theprocessor 101 has computed, a result data register 62 is selected by anaddress, followed by reading result data from the processor 101. At thistime, the flag encoder 59 sends RESULT SEND.

If a neighbor array operation unit 100 has been able to receive acalculation datum, the processor 101 writes the calculation datum to anaddress of an output data register 63, followed by that the controller103 stores the calculation datum in the output data register 63. Afterthat, the controller 103 sends the calculation datum to some adjoiningarray operation units 100. Suppose that SIGNALS are received from anupper array operation unit 100. The calculation datum already receivedfrom the upper array operation unit 100 is stored in an upper input dataregister 64. After the upper input data register 64 is selected by anaddress, the calculation datum of the upper input data register 64 issent to the processor 101. Even though SIGNALS are received from eitheran lower, left or right array operation unit 100, it can work similarly,that is, a lower input data register 65, a left input data register 66,and a right input data register 67 work as well as the upper input dataregister 64 does.

Each block such as some buffers, some registers and the address decoder54 is a general digital circuit. The flag decoder 58 and the flagencoder 59 have input and output signals, as shown concretely in FIG. 63and FIG. 64.

TYPE represents some kinds of contents read by the output data register63 by one or more bits. The number of the bits is decided as an arrayoperation unit 100 can distinguish all calculation data due to transmit.COUNT-X and COUNT-Y denote one or more bits of unsigned integers,respectively, and represent transmit times between the array operationunits 100. In a case that the array operation unit 100 sends acalculation datum first, both the COUNT-X and the COUNT-Y are set tozero. Whenever the array operation unit 100 transmits a calculationdatum in horizontal directions, one is added to the COUNT-X. Wheneverthe array operation unit 100 transmits a calculation datum in verticaldirections, one is added to the COUNT-Y. After the processor 101specified which direction of upper, lower, left and right a content ofthe output data register 63 is sent to, to SEND FLAG of the flagregister 57, suppose that the flag decoder 58 receives CENTRAL DECODINGof the address decoder 54 specifying the output data register 63. Theflag decoder 58 outputs SEND to the specified directions in the SENDFLAG. The SEND FLAG denotes a four-bit signal. When the array operationunit 100 transmits a calculation datum to the up side, the processor 101sets the SEND FLAG to 1000. When the array operation unit 100 transmitsthe calculation datum to the down side, the processor 101 sets the SENDFLAG to 0100. When the array operation unit 100 transmits thecalculation datum to the left side, the processor 101 sets the SEND FLAGto 0010. When the array operation unit 100 transmits the calculationdatum to the right side, the processor 101 sets the SEND FLAG to 0001.In addition, in a case that the array operation unit 100 sends thecalculation datum to four array operation units 100, the processor 101sets the SEND FLAG to 1111.

Besides this, when result data are read to the result data register 62,the flag decoder 58 receives RESULT DECODING simultaneously, followed bysending RESULT SEND.

Whenever the flag encoder 59 receives SEND(INPUT) from at least one offour array operation units 100, it sends RECEIVE(OUTPUT), which ischanged to one immediately, to a receiving direction. Moreover, afterthe flag encoder 59 inputs TYPE of a calculation datum, COUNT-X andCOUNT-Y from the receiving direction, the corresponding part of contentsof status register 60 is updated. On the other hand, in a flag encoder59 in an array operation unit 100 of the sender, RECEIVE STATUS in thestatus register 60 is updated if the RECEIVE(INPUT) becomes one. In eacharray operation unit 100, therefore, the processor 101 can judge whichinput data register a valid calculation datum is memorized by, only bychecking RECEIVE STATUS in its status register 60. For example, supposethat a calculation datum is read by the right input data register 67.The processor 101 can read the calculation datum from the right inputdata register 67 by directing its address. RIGHT DECODING issimultaneously sent from the address decoder 54 to the flag encoder 59.After a part representing a right direction in RECEIVE STATUS goes backto zero, RECEIVE toward the right side, which represents zero, is sentIn all cases of the upper input data register 64, the lower input dataregister 65 and the left input data register 66, each array operationunit 100 also works similarly.

Besides this, whenever the flag encoder 59 receives at least one ofFRONT INPUT SENDs for some input images, the flag encoder 59 sets FRONTINPUT SEND STATUS in the status register 60 to one. Note that the FRONTINPUT SEND STATUS is used for an input image corresponding to thereceived FRONT INPUT SEND. Moreover, when the processor 101 readscalculation data from the front input data register 61 for input images,the address decoder 54 sends FRONT DECODING to the flag encoder 59.After that, the flag encoder 59 sets FRONT INPUT SEND STATUScorresponding to the received FRONT INPUT SEND to zero. The processor101 can judge whether a last input image is memorized in the front inputdata register 61, by reading contents of the status register 60.

It has been assumed above that the array operation unit 100 mainlygenerates an output image from one or more input image, but its circuithas to be changed as it can output some calculation data generated on away of calculation, according to an application. In this case, we haveonly to increase the same number of RESULT SENDs in the flag encoder 58as the number of result data to output, followed by changing a programas only RESULT SENDs corresponding to result data read by the resultdata register 62 are set to one.

It is explained here about the flag decoder 58, the flag register 57,the flag encoder 59 and the status register 60, referring to someconcrete circuit diagrams.

In a case that a digital circuit 402 of IC number, 74LS377, is used asthe flag register 57, circuit diagrams of the flag decoder 58 and theflag register 57 are like FIG. 65. Note that a WRITE synchronizes with aCLK, and the flag register 57 stores a flag via internal data bus 56when the WRITE rose. In addition, a circuit on a RESULT SEND is omittedin FIG. 65. In FIG. 65, after passing one clock from a time that boththe WRITE and a CENTRAL DECODING are active, a SEND(OUTPUT) is outputtedfor only one clock period. On the other hand, after storing the flag,the flag register 57 outputs a TYPE of the calculation datum, a COUNT-Xand a COUNT-Y immediately. If a designer of the flag decoder 58 wants tochange timing of sending the SEND (OUTPUT), he has only to change thenumber of flip-flops for send 81 or invert logic of a trigger of theflip-flops for send 81.

In a case that a digital circuit 402 of IC number, 74ALS573, is used asthe status register 60, circuit diagrams of the flag encoder 59 and thestatus register 60 are like FIG. 66. Note that a READ synchronizes witha CLK, and the processor 101 stores a status via the internal data bus56 when the READ is active and the CLK rose. In addition, a circuit on aFRONT INPUT SEND is omitted in FIG. 66. Some pull-down resistors areattached to input terminals from four neighbor array operation units100. A SEND(INPUT), a TYPE of a calculation datum, a COUNT-X and aCOUNT-Y received from each of left and right array operation units 100are inputted by a status circuit for horizontal directions 82, and aSEND (INPUT), a TYPE of a calculation datum, a COUNT-X and a COUNT-Yreceived from each of upper and lower array operation units 100 areinputted by a status circuit for vertical directions 83. FourRECEIVE(OUTPUT) outputted by the status circuit for horizontaldirections 82 and the status circuit for vertical directions 83 arestored asynchronously in a status register 60 with four RECEIVE(INPUT)received from four neighbor array operation units 100. Therefore, theprocessor 101 can understand a situation of communicating with the fourneighbor array operation units 100, only by reading the status from thestatus register 60.

A circuit diagram of the status circuit for horizontal directions 82 inan array operation unit 100 connected with a right array operation unit100 is like FIG. 67. If the status circuit for horizontal directions 82receives a SEND (INPUT) which is equal to one, a latch circuit for sendinput 85 memorizes the SEND(INPUT) asynchronously. Therefore, aRECEIVE(OUTPUT) remains one until a RIGHT INPUT DECODING is inputted bythe status circuit for horizontal directions 82. Moreover, since thestatus circuit for horizontal directions 82 can reply the RECEIVE(INPUT)which is equal to one to the right array operation unit 100, the rightarray operation unit 100 can receive a RECEIVE(INPUT) which is equal toone after sending a SEND(OUTPUT) which is equal to one within a halfperiod of the clock signal. In the right array operation unit 100,therefore, the processor 101 does not have to wait until it reads aRECEIVE STATUS from the status register 60 after writing the SEND FLAGto the flag register 57. In addition, the status circuit for horizontaldirections 82 adds one to the COUNT-X received, by using some halfadders for counting 84 On the other hand, the TYPE of the calculationdatum, the COUNT-X and the COUNT-Y are stored asynchronously to thestatus register 60 while the SEND(INPUT) is one. Here, the calculationdatum is also stored asynchronously to a right input data register 67,by using the SEND(INPUT). When both a READ and a STATUS REGISTER RIGHTDECODING are active, the status register 60 outputs the TYPE of thecalculation datum, the COUNT-X and the COUNT-Y to the processor 101 viathe internal data bus 56. Note that, in the circuit diagram of thestatus circuit for horizontal directions 82 connected with a left arrayoperation unit 100, a LEFT INPUT DECODING and a STATUS REGISTER LEFTDECODING are used instead of the RIGHT INPUT DECODING and the STATUSREGISTER RIGHT DECODING, respectively. In addition, in a circuit diagramof the status circuit for vertical directions 83, one is added to theCOUNT-Y received, by using some half adders for counting 84.

It has been described above about the array operation unit 100comprising only one controller 103. However, in a case that the arrayoperation unit 100 comprises only one controller 103, transmissionefficiency may drop. It is explained here about an array operation unit100 comprising some controllers 103.

As shown in FIG. 68, an array operation unit 100 can comprise somecontrollers 103. In a case of FIG. 68, the array operation unit 100 hasfive controllers 103 arranged on a diagonal line, and each controller103 is connected to address bus 51 and data bus 52. Five differentaddresses are assigned to address decoders 54 in the five controllers103, respectively, as the processor 101 can distinguish thesecontrollers 103. Since each controller 103 comprises a front input dataregister 61 and a result data register 62, all controllers 103 can inputsome front input data sets independently, and output a result data.Furthermore, the array operation unit 100 can extend communication bandsup to five times, by connecting each controller 103 to a controller 103in the adjoining array operation unit 100, which is different from eachother. Even though the array operation unit 100 transmits the image, thenumber of whose bands is as many as the transfer-sourceredundant-information image 184, therefore, the more controllers 103 thearray operation unit 100 comprises, the less the transmission efficiencycomes to decrease.

In a case that the array operation unit 100 comprises some controllers103, note that the processor 101 must supervise STATUSes in the statusregisters 60 in all controllers 103. A round robin system is mainly usedfor supervisor scheduling.

In the round robin system, some controllers 103 are arranged logicallyin the shape of a circle. The processor 101 accesses these controllers103 along the circle in turns. If the controller 103 has received acalculation datum, the processor 101 reads the calculation datum fromthe controller 103. After that, the processor 101 accesses the nextcontroller 103. All controllers 103, thus, are treated on equal terms.In a case that the communication bands of the controller 103 is narrowerthan the amount of data transmitted by the array operation unit 100 fora short time, this system is effective.

Besides this, we can use a priority system in which the processor 101accesses some controllers 103 in an order from the highest priority eachtime, by giving numbers to all controllers 103. Note that the numbersare called the priority and they are different from each other. In acase that the communication bands of the controller 103 is wider thanthe amount of data transmitted by the array operation unit 100 for ashort time, this system is effective.

In general, since it is assumed that the array operation unit 100comprises only a few controllers 103, the round robin system is betterthan the priority system in a case that the visual device 2 carries outlocal and parallel image processing. Suppose, however, that the arrayoperation unit 100 has the enough number of controllers 103 in order forthe visual device 2 to carry out local and parallel image processingincluding some functions, in which the visual device 2 must transmit alot of data. In this case, communication efficiency of the round robinsystem comes to fall if the remaining functions refer to only band-pixelvalues in four neighbors or eight neighbors 182. Therefore, the prioritysystem is better than the round robin system. Of course, if interruptfunction is installed in all controllers 103 and a processor 101, theprocessor 101 does not have to supervise STATUS in a status register 60in each controller 103 periodically.

Now, in a case that some controllers 103 are arranged on a mounting sideof LSI (Large-scale Integration Circuits), there are three majorproblems as follows: First, a mounting area of an LSI comes to be verylarge. Second, wiring between the controllers 103 is complex and long.Third, we can not increase the number of the controllers 103 easily. Ifthree-dimensional LSI technology is adopted, however, an LSI designercan solve these problems easily. It is explained here about an arrayoperation unit 100 adopting the three-dimensional LSI technology.

As shown in FIG. 69, the controllers 103 are stacked within the arrayoperation unit 100, by using the three-dimensional LSI technology. In acase of FIG. 69, five controllers 103 are stacked on the processor 101and the memory 102, and each controller 103 is connected to theprocessor 101 and the memory 103 via address bus 51 and data bus 52which were wired vertically. As is clear by FIG. 69, even though thenumber of the controllers 103 is increased, the mounting area of eachlayer is not increased. In addition, each controller 103 has only to beconnected to some adjoining controllers 103 in the same layer. Moreover,if the LSI designer would like to increase the number of the controllers103, he can increase only the required number of layers implementing thecontrollers 103. He also never has to revise layers underlying theappended layers if even address bus 51 of the controllers 103 isdesigned appropriately. With a natural thing, since a controller 103 ineach layer is constructed by the same circuit except an address decoder54, a controller 103 in a layer stacked newly is designed very easily.

As shown in FIG. 68 and FIG. 69, now, suppose that an array operationunit 100 comprises some controllers 103. Not only the array operationunit 100 can expand communication bands between some adjoining arrayoperation units 100, but also it can distinguish which controller 103 itreceived from, and which data it received. It is explained here about adata processing device 110 which gets together some successive arrayoperation units 100 into one group, whose array operation units 100share a processor 101 and a memory 102, by using some controllers 103.

As shown in FIG. 70, first, some array operation units 100 arranged inthe shape of a two-dimensional lattice are got together into arectangular group whose size is suitable. This group is called a virtualarray operation unit 105. In a case of FIG. 70, the virtual arrayoperation unit 105 is a group which gets together 4×4 array operationunits 100. As shown in FIG. 61, FIG. 68 and FIG. 69, next, the virtualarray operation unit 105 comprises a processor 101, a memory 102 andcontrollers 103, the number of which is more than or equal to maximum ofthe vertical number and the horizontal number of array operation units100. In a case of FIG. 70, the virtual array operation unit 105 needs atleast four controllers 103. Note that each of the controllers 103comprises a status circuit for horizontal directions 82 like FIG. 67.Numbers, 1 to 4, are assigned to the controllers 103 for convenience'sake. Even though the number of the controllers 103 goes over four, thenumbers, 1 to 4, are assigned to the controllers 103. Therefore, somecontrollers 103 are assigned to a specific array operation unit 100. Asshown in FIG. 71, in addition, the same numbers as the numbers ofcontrollers 103, which is different from each other, are also given tocommunication lines between array operation units 100. Note that twonumbers facing each other becomes equal, for each of upward-downward andleftward-rightward communication lines. Finally, a program, by which theprocessor 101 carries out processing of 16 array operation units 100, ismemorised in the memory 102. In a case that each of the array operationunits 100 communicates with some array operation units 100 in anadjoining virtual array operation unit 105, this program is implementedas the array operation unit 100 must communicate via a controller 103whose number identifies with a number given to a communication line.Therefore, the virtual array operation unit 105 can distinguish whicharray operation unit 100 a calculation datum was sent from, and whicharray operation unit 100 the calculation datum was sent to.

By the way, a virtual array operation unit 105 must input front inputdata sets from other virtual array operation units 105, and outputresult data to other virtual array operation units 105. Therefore, thevirtual array operation unit 105 can not implement some array operationunits 100 completely, only by increasing the number of controllers 103.In a case that some controllers 103 are implemented on a two-dimensionalplane, as shown in FIG. 68, this problem is solved by a program, bygiving the controllers 103 to some numbers, as similar to calculationdata, if the number of the controllers 103 is enough. Even in a case ofFIG. 71, however, 16 controllers 103 must be prepared. When the numberof array operation units 100 included in a virtual array operation unit105 was increased, this method becomes very inefficient. In a case thatthe controllers 103 are stacked, furthermore, as shown in FIG. 69, it isvery difficult for the virtual array operation unit 105 to securecommunication lines for the front input data sets and the result data.It is described here about a method for solving this problem, bychanging only a front input data register 61 in a controller 103.

Suppose first that a controller 103 inputs result data as front inputdata of a front input data set from another controller 103. Suppose,moreover, that it inputs a RESULT SEND as a FRONT INPUT SEND. In thiscase, as shown in FIG. 72, a front input data register 61 comprises afront input shift register 68 and a front input counter 69. Note thatthe front input shift register 68 consists of the same number ofregisters as the number of array operation units 100 in a virtual arrayoperation unit 105. The front input counter 69 is a down counter whoseinitial value is the number of the registers. When a count number of thefront input counter 69 became zero, the front input counter 69 outputsthe FRONT INPUT SEND. The front input counter 69 is then initialized tothe initial value if the result data are inputted. The front input shiftregister 68 consists of 16 registers in FIG. 72. If 16 result data areinputted by the front input shift register 68, the FRONT INPUT SEND isoutputted. Next, each register in the front input shift register 68 andthe front input counter 69 input the FRONT INPUT SEND as a triggersignal. Moreover, an address decoder 54 selects one of the registers inthe front input shift register 68, by decoding an address. Eachregister, thus, can output the front input data to data bus 52 if aprocessor 101 specified an address of a suitable register in the frontinput shift register 68. Note that other signal lines of the addressdecoder 54 are omitted in FIG. 72. Suppose that the virtual arrayoperation unit 105 outputs front input data of 16 array operation units100 in fixed turns. The front input data are memorized by the registersin the front input shift register 68 in the order of their outputs. Atthe time that the FRONT INPUT SEND outputted by the front input counter69 was memorized by a status register 60, the processor 101 can get thefront input data of a specific array operation unit 100.

Note that the array operation unit 100 can transmit a calculation datumefficiently, by transmitting the calculation datum counter-clockwisely,as shown in FIG. 73. Of course, the array operation unit 100 cantransmit the calculation datum clockwisely. Here, if the memory 102 andthe processor 101 comprise a stack and a cyclic buffer, the arrayoperation unit 100 can store only calculation data to be transmittedbeforehand in the stack and the cyclic buffer. Therefore, when the arrayoperation unit 100 writes the calculation datum to the controller 103,the array operation unit 100 can refer only the calculation datum withina short time. Similarly, the virtual array operation unit 105 cantransmit a calculation datum efficiently, by transmitting thecalculation datum counter-clockwisely and clockwisely, as shown in FIG.74.

Now, it has been described above such methods as a processor 101 reads acalculation datum from a controller 103 or writes the calculation datumto the controller 103. In the methods, hardware complexity of acontroller 103 becomes a little because the processor 101 carries outcalculation necessary to transmit the calculation datum. Therefore, anarray operation unit 100 and a virtual array operation unit 105 cancomprise many controllers 103. Whenever the controller 103 transmits thecalculation datum, however, the processor 101 must communicate thecalculation datum with the controller 103. Therefore, not onlycommunication time of the processor 101 becomes long, but also theprocessor 101 must check transmission times of the calculation datum, inorder to finish transmitting the calculation datum. It is explained hereabout a method that the number of times communicating the calculationdatum with the controller 103 is reduced, and moreover, that theprocessor 101 does not have to check the transmission times of thecalculation datum.

As shown in FIG. 77 to FIG. 80, in an enforcement form of a visualdevice 2 corresponding to the invention described in claim 12, thesuccessive numbers are assigned to two or more controllers 103 comprisedby an array operation unit 100. In addition, when the numbers areassigned to all controllers 103, some signal lines are wired in such away as each of all controllers 103 can send a calculation datum to somecontrollers 103 among controllers 103 in an adjoining array operationunit 100, whose number shifts only one from it. For example, in FIG. 77to FIG. 80, an array operation unit 100 comprises four controllers 103,where the numbers, 0 to 3, are assigned to the controllers 103,respectively. FIG. 77 shows that each controller 103 in all arrayoperation units 100 sends a calculation datum to one among fourcontrollers 103 in an upper array operation unit 100, whose number isonly one smaller than it. Note that the calculation datum received bythe controller 103 with the number, 0, is destroyed. FIG. 78 shows thateach controller 103 in all array operation units 100 sends a calculationdatum to one among four controllers 103 in a lower array operation unit100, whose number is only one bigger than it. Note that the calculationdatum received by the controller 103 with the number, 3, is destroyed.FIG. 79 shows that each controller 103 in all array operation units 100sends a calculation datum to one among four controllers 103 in a leftarray operation unit 100, whose number is only one bigger than it. Notethat the calculation datum received by the controller 103 with thenumber, 3, is destroyed. FIG. 80 shows that each controller 103 in allarray operation units 100 sends a calculation datum to one among fourcontrollers 103 in an upper array operation unit 100, whose number isonly one smaller than it. Note that the calculation datum received bythe controller 103 with the number, 0, is destroyed. Since eachcontroller 103 transmits a calculation datum, according to flows ofcalculation data shown in FIG. 77 to FIG. 80, transmission times of thecalculation datum are less than or equal to three times. Moreover, sincethe processor 101 writes the calculation datum to a controller 103 withany number, the calculation datum is transmitted only times related withthe number of the controller 103. For example, in FIG. 77, if acalculation datum was written to a controller 103 with the number, 2,the calculation datum is transmitted upward only two times. Similarly,in FIG. 78, if a calculation datum was written to the controller 103with the number, 2, the calculation datum is transmitted downward onlyone time. Therefore, after the processor 101 calculated transmissiontimes of the calculation datum first, the processor 101 does not have tocheck the transmission times. Moreover, after the processor 101 wrotethe calculation datum to a controller 103 first, a processor 101 in eachof some upper array operation units 100 has only to reads thecalculation datum. As a result, the processor 101 does not have to writethe calculation datum again. In short, a processor 101 in each arrayoperation unit 100 can reduce access times to some controllers 103. InFIG. 77 to FIG. 80, some array operation units 100 are arranged in theshape of a lattice, but these facts are similar even though some virtualarray operation units 105 are arranged in the shape of a lattice. Inaddition, as shown in FIG. 81, these facts are similar even though somecontrollers 103 are stacked.

By the way, a calculation datum can be transmitted to either one ofupper, lower, left and right directions only specific times, by themethods shown in FIG. 77 to FIG. 80. In order to transmit thecalculation datum counter-clockwisely and clockwisely in the shape of aspiral like FIG. 76, transmitting to two directions among the upper,lower, left and right directions has better be combined, as shown inFIG. 82. In order to transmit the calculation datum to 48 neighbors ofarray operation units 100 counter-clockwisely, note that FIG. 82 shows acase that the calculation datum is transmitted to three upper arrayoperation units 100 in each of three right array operation units 100while the calculation datum is transmitted to the three array operationunits 100. As shown by dashed curves, here, the calculation datumreceived by a controller 103 in each of the three right array operationunits 100 is transmitted to a controller 103 with the number, 3. Thistransmission is called retransmission. Note that the retransmission isgenerally carried out by a processor 101. This reason is that the numberof a controller 103, to which a calculation datum received by thecontroller 103 is written, is varied by size of neighbors to which thecalculation datum is transmitted, that is, the number of combinations ofretransmission becomes up to a square of the number of controllers 103.In addition, even though the array operation unit 100 comprises manycontrollers 103, the processor 101 can retransmit the calculation datumbetween any controllers 103. As shown in FIG. 83, suppose that some (noweight) controllers 103 are divided into two sets every four controllers103, and the numbers, 0 to 3 and 0′ to 3′, are assigned to them,respectively. Moreover, the controllers 103 with the numbers, 0 to 3,are assigned for transmission, and the controllers 103 with the numbers,0′ to 3′, are assigned for retransmission. Since a processor 101retransmits a calculation datum received by the controllers 103 fortransmission to the controllers 103 for retransmission, the calculationdatum is transmitted to six array operation units 100 in a horizontaldirection and to six array operation units 100 in a vertical direction,via the controllers 103 for transmission, followed by transmitting it to48 neighbors of array operation units 100 via the controllers 103 forretransmission. In this method, some calculation data beforeretransmitting and some calculation data after retransmitting aretransmitted individually by the controllers 103 for transmission and thecontrollers 103 for retransmission, respectively, in transmitting thecalculation data before retransmitting and the calculation data afterretransmitting are transmitted toward one direction. Therefore, theprocessor 101 can carries out retransmitting efficiently.

Now, it has been described above about flows of calculation data betweencontrollers 103 and retransmission. The controller 103 like FIG. 62,however, can not carry out such a transmission method. It is explainedhere about a new controller 103 comprising a function transmitting thecalculation data. Although width of internal data bus 56 can be decidedfreely, suppose that the width of the internal data bus 56 is 16 bits.In addition, it is explained here, referring to an array operation unit100, but it is similar even in a case of a virtual array operation unit105 if there are no specific indications.

As shown in FIG. 84, first, a controller 103 comprises an address buffer53, a data buffer 55, an address decoder 54, four transmit circuits 801,one or more front input circuits 802, one or more result output circuits803 and a communication status buffer 804. Note that a signal x′ denotesa negative-logic of a signal x, and a thick line denotes a ream of somesignals. Here, four transmit circuits 801 transmit a calculation datumand a calculation status from a down side to an up side, from an up sideto a down side, from a right side to a left side, and from a left sideto a right side, respectively. Therefore, in order to realize flows ofcalculation data shown in FIG. 77, transmit circuits 801 transmitting acalculation datum from a down side to an up side are connected with eachother, in each controller 103. Similarly, in cases of FIG. 78 to FIG.80, transmit circuits 801 transmitting the calculation datum from an upside to a down side, a right side to a left side and a left side to aright side are connected with each other, respectively. A detail of thetransmit circuit 801 is explained later.

Next, the address buffer 53, the data buffer 55 and the address decoder54 are similar with the past ones. Note that the address decoder 54generates some decoding signals, if desired.

Next, the communication status buffer 804 outputs a SEND STATUS towardeach of up, down, left and right directions, a RECEIVE STATUS towardeach of up, down, left and right directions, a FRONT INPUT STATUS and aRESULT STATUS, which are outputted by four transmit circuits 801, afront input circuit 802 and a result output circuit 803, to the internaldata bus 56. A general line buffer is used as the communication statusbuffer 804. Note that, as is clear from FIG. 85, in a case of theinternal data bus 56 with 16-bit width, the communication status buffer804 can increase the number of the FRONT INPUT STATUSes and the RESULTSTATUSes up to seven, respectively. Therefore, a designer of thecontroller 103 can increase the number of the front input circuits 802and the result output circuits 803, if desired.

As shown in FIG. 86, next, whenever a FRONT INPUT SEND rose, thefront-input-data input register 831 memorizes some (now 16) front inputdata in order, in the front input circuit 802. Of course, when the FRONTINPUT SEND fell, the front-input-data input register 831 can alsomemorize some (now 16) front input data in order. Moreover, thefront-input-data counter 836 counts rising times of the FRONT INPUTSEND. After the rising times arrived at appointed times, a COUNTMINIMUM′ is outputted as zero. Note that other counters, of course, canbe used although a 74LS169 IC is used as a counter of thefront-input-data counter 836 in FIG. 86. In addition, once the COUNTMINIMUM′ becomes zero, some (now 16) front input data are memorized by afront-input-data output register 833. Therefore, even though additionalfront input data are inputted, the front input data memorized by thefront-input-data output register 833 are never changed. After that,whenever a FRONT INPUT DECODING0′ became zero, some front input datamemorized by the front-input-data output register 833 are shifted,followed by outputting to the internal data bus 56 one by one via afront-input-data line buffer 834.

Now, a state transition diagram of a controller for front-input circuit835 is like FIG. 87. It is explained here about the state transitiondiagram.

A state 841 is a WAIT state (01). It sets a FRONT INPUT STATUS to zero,a LOAD to one, and a UPDATABLE′ to one. If a RESET′ is active, it goesto the state 841. In addition, if a COUNT MINIMUM′ is zero, it goes to astate 842. Otherwise, it goes to the state 841.

The state 842 is a LOAD state (00). It sets the FRONT INPUT STATUS tozero, the LOAD to one, and the UPDATABLE′ to zero, followed by going toa state 843.

The state 843 is a SHIFT PREPARATION state (11). It sets the FRONT INPUTSTATUS to one, the LOAD to zero, and the UPDATABLE′ to one. If a FRONTINPUT DECODING0′ is zero, it goes to a state 844. Otherwise, it goes tothe state 843.

The state 844 is a SHIFTING state (10). It sets the FRONT INPUT STATUSto one, the LOAD to zero, and the UPDATABLE′ to zero, followed by goingto the state 843.

Note that the number assigned to each state can be varied.

In addition, although the front-input-data input register 831 inputsfront input data according to the width of the internal data bus 56 inFIG. 86, of course, it can input the front input data every one bit. Inthis case, the maximum count number of the front-input-data counter 836becomes a product of a specific times (now 15 times) and the number ofbits of the internal data bus 56. By inputting the front input dataevery one bit like this, an LSI designer can reduce the number ofvertical signal lines 278 very much, in implementing a visual device 2into a three-dimensional LSI. Therefore, the LSI designer can reduce thenumber of vias whose implement area is big. Thus, implementation of thethree-dimensional LSI.

Next, as shown in FIG. 88, a RESULT DECODING0′ is selected in the resultoutput circuit 803. Moreover, whenever a WRITE′ rose, a result-datainput register 851 memorizes some (now 16) result data via the internaldata bus 56, shifting them. After this, when a RESULT DECODING1′ becameactive, and moreover, the WRITE′ rose, the RESULT STATUS becomes one. Acontroller for result-output circuit 854 transfers some result data tothe result-data output register 853 via a result-data multiplexer 852,while it shifts some result data in the result-data output register 853via the result-data multiplexer 852. Here, the RESULT SEND repeats oneand zero. Moreover, a result-data counter 856 counts output times of theresult data. After the output times arrived at appointed times (now 16times), the RESULT STATUS is outputted as zero. Note that othercounters, of course, can be used although a 74LS169 IC is used as acounter of the result-data counter 836 in FIG. 88.

Now, a state transition diagram of a controller for result-outputcircuit 854 is like FIG. 89. It is explained here about the statetransition diagram.

A state 861 is a WAIT state (111). It sets a RESULT RESET′ to one, aCOUNTABLE′ to one, and an UPDATABLE′ to one. If a RESET′ is active, itgoes to the state 861. In addition, if a RESULT STATUS is one, it goesto a state 862. Otherwise, it goes to the state 861.

The state 862 is a LOAD state (110). It sets the RESULT RESET′ to one,the COUNTABLE′ to one, and the UPDATABLE′ to zero. If a COUNT MAXIMUM′is zero, it goes to a state 864. Otherwise, it goes to a state 863.

The state 863 is a SHIFTING state (100). It sets the RESULT RESET′ toone, the COUNTABLE′ to zero, and the UPDATABLE′ to zero. If the COUNTMAXIMUM′ is zero, it goes to the state 864. Otherwise, it goes to thestate 863.

The state 864 is a SHIFT END state (011). It sets the RESULT RESET′ tozero, the COUNTABLE to one, and the UPDATABLE′ to one, followed by goingto the state 861.

Note that the number assigned to each state can be varied.

In addition, although the result-data output register 853 and theresult-data multiplexer 852 shift the result data, according to thewidth of the internal data bus 56 in FIG. 88, of course, they can inputthe result data every one bit. In this case, the maximum count number ofthe result-data counter 856 becomes a product of a specific times (now15 times) and the number of bits of the internal data bus 56. Byinputting the result data every one bit like this, an LSI designer canreduce the number of vertical signal lines 278 very much, inimplementing a visual device 2 into a three-dimensional LSI. Therefore,the LSI designer can reduce the number of vias whose implement area arebig. Thus, implementation of the three-dimensional LSI.

Now, it has been described above about a part except the transmitcircuits 801 in the new controller 103. It is explained here about thetransmit circuit 801.

As shown in FIG. 90, each transmit circuit 801 comprises a controllerfor positive-logical transmit circuit 811 a, a latch forpositive-logical transmit 812 a, a send-status generation circuit 813, acalculation-data receive latch 814 a, a calculation-status receive latch814 b, a calculation-data line buffer 815 a, a calculation-status linebuffer 815 b, a calculation-data send buffer 816 a, a calculation-statussend buffer 816 b, a calculation-data multiplexer 817 a and acalculation-status multiplexer 817 b. Note that some pull-up resistorsand pull-down resistors are attached to input terminals, if desired.When a SEND(INPUT) is active, a calculation datum and a calculationstatus received from a controller 103 in adjoining array operation units100 are memorized in the calculation-data receive latch 814 a and thecalculation-status receive latch 814 b. When a RECEIVE CALCULATION DATADECODING′ is active, and a READ′ is also active, the calculation datumis outputted to the internal data bus 56 via the calculation-data linebuffer 815 a. In addition, when a RECEIVE CALCULATION STATUS DECODING′is active, and the READ′ is also active, the calculation status isoutputted to the internal data bus 56 via the calculation-status linebuffer 815 b. On the other hand, when a SEND CALCULATION DATA DECODING′is active, and a WRITE′ is also active, a calculation datum and acalculation status written by the processor 101 via the internal databus 56 are memorized by the calculation-data send buffer 816 a and thecalculation-status send buffer 816 b. The calculation-data multiplexer817 a selects a calculation datum from either the calculation-datareceive latch 814 a or the calculation-data send buffer 816 a, accordingto a SEND/TRANSMIT SWITCH, followed by sending it to a controller 103 inthe adjoining array operation units 100. The calculation-statusmultiplexer 817 b selects a calculation status from either thecalculation-status receive latch 814 b or the calculation-status sendbuffer 816 b, according to the SEND/TRANSMIT SWITCH, followed by sendingit to a controller 103 in the adjoining array operation units 100. Here,a SEND(OUTPUT) becomes active. When the SEND(INPUT) is active, the latchfor positive-logical transmit 812 a makes a RECEIVE(OUTPUT) active,while it sets a RECEIVE STATUS and a TRANSMIT STATUS to one. Note thatthe RECEIVE STATUS becomes zero when the RECEIVE CALCULATION STATUSDECODING′ is active. However, when the RECEIVE CALCULATION DATADECODING′ is active, the RECEIVE STATUS can also become zero. Inaddition, when a TRANSMIT RESET′ is active, the TRANSMIT STATUS becomeszero. The send-status generation circuit 813 sets the SEND STATUS to onewhen the calculation status was written to the calculation-status sendbuffer 816 b. Note that the send-status generation circuit 813 can alsoset the SEND STATUS to one when the calculation data was written to thecalculation-data send buffer 816 a. When a SEND RESET′ is active, theSEND STATUS becomes zero. The controller for positive-logical transmitcircuit 811 a inputs the RECEIVE(INPUT), followed by outputting theSEND(OUTPUT), while it inputs the SEND STATUS and the TRANSMIT STATUS,followed by outputting the SEND/TRANSMIT SWITCH, the SEND RESET and theTRANSMIT RESET.

Now, a state transition diagram of the controller for positive-logicaltransmit circuit 811 a is like FIG. 91. It is explained here about thestate transition diagram.

A state 821 is a WAIT state (01100). It sets a SEND RESET′ to one, aTRANSMIT RESET′ to one, a SEND(OUTPUT) to zero, and a SEND/TRANSMITSWITCH to zero. If a RESET′ is active, it goes to the state 821. If aRECEIVE(INPUT) is zero and a TRANSMIT STATUS is one, it goes to a state822. If the RECEIVE(INPUT) is zero, the TRANSMIT STATUS is zero, and aSENDT STATUS is one, it goes to a state 825. Otherwise, it goes to thestate 821.

The state 822 is a TRANSMIT START state (11110). It sets the SEND RESET′to one, the TRANSMIT RESET′ to one, the SEND(OUTPUT) to one, and theSEND/TRANSMIT SWITCH to zero, followed by going to the state 823.

The state 823 is a TRANSMITTING state (11010). It sets the SEND RESET′to one, the TRANSMIT RESET′ to one, the SEND(OUTPUT) to zero, and theSEND/TRANSMIT SWITCH to zero. If the RECEIVE(INPUT) is zero, it goes toa state 824. Otherwise, it goes to the state 823.

The state 824 is a TRANSMIT END state (11000). It sets the SEND RESET′to one, the TRANSMIT RESET′ to zero, the SEND(OUTPUT) to zero, and theSEND/TRANSMIT SWITCH to zero, followed by going to the state 821.

The state 825 is a SEND END state (11111). It sets the SEND RESET′ toone, the TRANSMIT RESET′ to one, the SEND (OUTPUT) to one, and theSEND/TRANSMIT SWITCH to one, followed by going to the state 826.

The state 826 is a SENDING state (11001). It sets the SEND RESET′ toone, the TRANSMIT RESET′ to one, the SEND(OUTPUT) to zero, and theSEND/TRANSMIT SWITCH to one. If the RECEIVE(INPUT) is zero, it goes to astate 827. Otherwise, it goes to the state 826.

The state 827 is a SEND END state (10101). It sets the SEND RESET′ tozero, the TRANSMIT RESET′ to one, the SEND(OUTPUT) to zero, and theSEND/TRANSMIT SWITCH to one, followed by going to the state 821.

Note that the number assigned to each state can be varied.

A transmit circuit 801 is shown in FIG. 90, where the SEND(INPUT), theSEND(OUTPUT), the RECEIVE(INPUT) and the RECEIVE(OUTPUT) are positivelogic. Of course, however, the SEND(INPUT), the SEND(OUTPUT), theRECEIVE(INPUT) and the RECEIVE(OUTPUT) can be also negative logic, asshown in FIG. 92. In this case, logic of the SEND(INPUT), theSEND(OUTPUT), the RECEIVE(INPUT) and the RECEIVE(OUTPUT) is inverted, byusing an inverter for send 818 and so on, if desired.

As shown in FIG. 93, furthermore, a register for negative-logicaltransmit 812 c, a calculation-data receive register 814 c and acalculation-status receive register 814 d are used instead of the latchfor negative-logical transmit 812 b, the calculation-data receive latch814 a and the calculation-status receive latch 814 b, respectively. Inaddition, when the SEND(INPUT)′ rose, the RECEIVE(OUTPUT)′ becomesactive, while a calculation data and a calculation status received froma controller 103 in adjoining array operation units 100 are memorized bythe calculation-data receive register 814 c and the calculation-statusreceive register 814 d, respectively.

Now, it has been described above about the visual device 2. It isexplained here about the enforcement forms of interlocked devices in thepresent invention, with reference to the drawings.

As shown in FIG. 96, first, an enforcement form of an interlockedcounter 401 corresponding to the invention described in claim 13consists of a counter part and an interlocked part, where the counterpart consists of a synchronous counter 411, a logic gate for judgingend-value 412 and a logic gate for enable signal 416, and theinterlocked part consists of a logic gate for amplifying interlockingsignal 413, a latch circuit for interlocking signal 414 and a logic gatefor interlocking signal 415. In FIG. 96, in addition, suppose that theinterlocked counter 401 inputs three interlocked signals, BLK1′, BLK2′and BLK3′, from three other interlocked counters 401. Note that a signalx′ denotes a negative-logic of a signal x. In FIG. 96, furthermore, anAND gate is used as the logic gate for judging end-value 412, two NANDgates are used as the logic gate for enable signal 416 and the latchcircuit for interlocking signal 414, a NOT gate is used as the logicgate for amplifying interlocking signal 413, and an OR gate is used asthe logic gate for interlocking signal 415. Of course, other logic gatescan be used.

In the counter part, the synchronous counter 411, the logic gate forjudging end-value 412 and the logic gate for enable signal 416 areconnected circularly. That is, the synchronous counter 411 inputs anenable signal P, followed by outputting a count number. The logic gatefor judging end-value 412 inputs the count number, followed byoutputting an interlocking signal BLK0. The logic gate for enable signal416 inputs the interlocking signal BLK0 via at least one input terminal,followed by outputting the enable signal P.

For example, in a case of FIG. 97, the synchronous counter 411 comprisesthree JK flip-flops, and outputs the count number from zero to seven, byusing outputs of the JK flip-flops, QA, QB and QC. In addition, the JKflip-flops can also output negative-logic outputs, QA′, QB′ and QC′, ofthe outputs, QA, QB and QC, respectively. After a clock signal wasinverted by a logic gate for counter 422 c, it is distributed to clockterminals of the three JK flip-flops, at two turning points, D1 and D2.The JK flip-flops works according to rising edge of the clock signal. Anenable signal P is distributed to a J terminal and a K terminal of theleft JK flip-flop, at a turning point E1. Therefore, when voltage of theenable signal P is High level, voltage at both the J terminal and the Kterminal of the JK flip-flop becomes High level. Whenever the clocksignal CLK rose, voltage of the outputs, QA and QA′, of the JK flip-flopis inverted. Similarly, the enable signal P is distributed to at leastone of input terminals of a logic gate for counter 422 a and a logicgate for counter 422 b at a turning point E2, respectively. In addition,the output signal QA is distributed to at least one of the inputterminals of the logic gate for counter 422 a and the logic gate forcounter 422 b at a turning point F, respectively. Moreover, the outputsignal QB is distributed to at least one of the input terminals of thelogic gate for counter 422 b. Output terminals of the logic gate forcounter 422 a and the logic gate for counter 422 b are connected with aJ terminal and a K terminal of the central and the right JK flip-flops,respectively. In a case that voltage of the enable signal P is Highlevel, therefore, voltage at both a J terminal and a K terminal of thecentral JK flip-flop becomes High level, if voltage of the output signalQA is High level. Thus, whenever the clock signal CLK rose, voltage ofthe output signal, QB and QB′, of the JK flip-flop is inverted. In acase that voltage of the enable signal P is High level, moreover,voltage at both a J terminal and a K terminal of the right JK flip-flopbecomes High level, if voltage of both the output signals, QA and QB, isHigh level. Thus, whenever the clock signal CLK rose, voltage of theoutput signal, QC and QC′, of the JK flip-flop is inverted. In short, ina case that voltage of the enable signal P is High level, whenever theclock signal CLK rose, the count number outputted by the synchronouscounter 411 increases one by one.

In FIG. 96, now, in order for the logic gate for judging end-value 412to output the interlocking signal BLK0, the output signals, QA, QB andQC are inputted at some (now three) input terminals of the logic gatefor judging end-value 412. If the count number outputted by thesynchronous counter 411 is seven, voltage of all the outputs, QA, QB andQC, becomes High level. Therefore, voltage of the interlocking signalBLK0 becomes High level. The interlocking signal BLK0 is inputted atleast one of input terminals of the logic gate for enable signal 416, ata turning point U1. If the interlocking signal BLK0 is Low level, theenable signal P becomes High level. Therefore, the synchronous counter411 increases the count number one by one until the count number arrivesat seven. When the count number arrived at seven, the synchronouscounter 411 stops.

Note that FIG. 97 can be changed easily to an N-figure binarysynchronous counter 411, by using N JK flip-flops, although it shows a3-figure binary synchronous counter 411 consisting of three JKflip-flops synchronized with the clock signal CLK. In addition, thesynchronous counter 411 can be changed to a down counter because thelogic gate for counter 422 a and the logic gate for counter 422 b inputthe output signals, QA′ and QB′instead of the output signals, QA and QB,respectively.

In the interlocked part, the logic gate for amplifying interlockingsignal 413 outputs the interlocking signal BLK0′ amplifying theinterlocking signal BLK0, while the logic gate for interlocking signal415 and the latch circuit for interlocking signal 414 control the logicgate for enable signal 416 according to the interlocking signals, BLK1′,BLK2′ and BLK3′, inputted from an external part. In short, if voltage ofthe interlocking signal BLK0 is High level, the logic gate foramplifying interlocking signal 413 makes voltage of the interlockingsignal BLK0′ Low level. Otherwise, the voltage of the interlockingsignal BLK0′ is High level. In addition, the interlocking signals,BLK1′, BLK2′ and BLK3′, are inputted at an input terminal of some (nowthree) latch circuits for interlocking signal 414 a to 414 c,respectively, while the interlocking signal BLK0 is distributed toanother input terminal of the latch circuits for interlocking signal 414a to 414 c at turning points, U2 and U3, respectively. Moreover, outputsignals, QG1′, QG2′ and QG3′ of the latch circuits for interlockingsignal 414 a to 414 c are inputted at some (now three) input terminalsof the latch circuits for interlocking signal 414, and an output signalG′ of the latch circuits for interlocking signal 414 is inputted atleast one terminal of the logic gate for enable signal 416. Therefore,in a case that the interlocking signal BLK0 is High level, and theinterlocking signals, BLK1′, BLK2′ and BLK3′, are all Low level, inshort, in a case that the interlocking signals, BLK0′, BLK1′, BLK2′ andBLK3′, are all Low level, all of the output signals, QG1′, QG2′ andQG3′, of the latch circuits for interlocking signal 414 a to 414 cbecome Low level. Also, the enable signal can become Low level. Inaddition, in a case that the interlocking signal BLK0 is High level,even though either the interlocking signals, BLK1′, BLK2′ and BLK3′,once becomes Low level, followed by that it returns to High level, thecorresponding one of the output signals, QG1′, QG2′ and QG3′, remainsLow level. In short, if the interlocking signal BLK0 is High level, theenable signal can become Low level even though the interlocking signals,BLK1′, BLK2′ and BLK3′, do not become Low level simultaneously. Notethat all of the output signals, QG1′, QG2′ and QG3′, of the latchcircuits for interlocking signal 414 a to 414 c become Low level if theinterlocking signal BLK0 becomes Low level. In addition, even though theinterlocking signal BLK0 becomes High level again, the output signals,QG1′, QG2′ and QG3′, of the latch circuits for interlocking signal 414 ato 414 c remain High level. The interlocked part, therefore, cancoincide phase and a cycle of the interlocking signal BLK0′ with phaseand a cycle of one among the interlocking signals, BLK1′, BLK2′, BLK3′and BLK4′, whose phase is the latest.

Although FIG. 96 shows a case that the interlocked counter 401 inputsinterlocking signals from three interlocked counters 401, note that thenumber of input terminals of the logic gate for interlocking signal 415can be varied, according to the number of the interlocked counters 401connected. Otherwise, the unnecessary input terminals of the logic gatefor interlocking signal 415 can be pulled down.

In the synchronous counter 411 shown in FIG. 96, now, an initial valueof the count number is fixed to zero, and an end value is fixed toseven. However, the initial value and the end value of the count numbermay be changed in terms of specification of LSIs. As shown in FIG. 98,then, an enforcement form of an interlocked counter 401 corresponding tothe invention described in claim 14 can set any initial value and anyend value, by using a synchronous counter 411 comprising a synchronousclear method and a synchronous load method like a commercial synchronouscounter 411.

For example, as shown in FIG. 98, in a case that the synchronous counter411 comprises the synchronous clear method, the synchronous counter 411,the logic gate for judging end-value 412 and the logic gate for enablesignal 416 are wired circularly in the counter part, while an outputterminal of a logic gate for initialization signal 417 is connected witha clear terminal of the synchronous counter 411. That is, thesynchronous counter 411 inputs the enable signal P and an initializationsignal INIT, followed by outputting the count number. The logic gate forenable signal 416 inputs the interlocking signal BLK0 at least one inputterminal, followed by outputting the enable signal P. The logic gate forinitialization signal 417 inputs the interlocking signal BLK0 and theenable signal P, followed by outputting the initialization signal INIT.

For example, in a case of FIG. 99, the synchronous counter 411 comprisesa 74163 up counter, and outputs the count number from 0 to 15, by usingthe output signals, QA to QD. In addition, the logic gate for counter422 a to the logic gate for counter 422 c output negative-logic outputs,QA′ to QC′, of the output signals, QA to QC, respectively. An enableterminal T is pulled up, a load terminal LOAD is pulled up, and aterminal for initial value, A to D, are pulled down. In a case thatvoltage of the enable signal P is High level, and a clear signal CLR isHigh level, whenever the clock signal CLK rises, the count numberoutputted by the synchronous counter 411 increases one by one. Moreover,in a case that the clear signal CLR is Low level, the count numberoutputted by the synchronous counter 411 becomes zero, if the clocksignal CLK rises, regardless of voltage of the enable signal P. In othercases, the synchronous counter 411 does not work.

In a case that the count number of the synchronous counter 411 is five,as shown in FIG. 98, then, the logic gate for judging end-value 412makes voltage of the interlocking signal BLK0 High level. Otherwise, thevoltage of the interlocking signal BLK0 is Low level. The interlockingsignal BLK0 is inputted at least one of input terminals of the logicgate for enable signal 416, at the turning point U1. Therefore, if theinterlocking signal BLK0 is Low level, the enable signal P becomes Highlevel. The synchronous counter 411 thus increases the count number oneby one until the count number arrives at five. When the count numberarrived at five, the synchronous counter 411 stops. The interlockingsignal BLK0 is inputted at least one of input terminals of the logicgate for initialization signal 417, at a turning point U4. Moreover, theenable signal P is inputted at least one of input terminals of the logicgate for initialization signal 417, at a turning point V. Therefore, ifboth the interlocking signal BLK0 and the enable signal P are Highlevel, the initialization signal INIT of the logic gate forinitialization signal 417 becomes Low level. Thus, the synchronouscounter 411 stops. If the interlocking signals, BLK1′, BLK2′ and BLK1′,once become Low level, the synchronous counter 411 sets the count numberto zero, followed by restarting working.

It has been described above about a circuit composition of only a singleinterlocked counter 401. It is explained here how some interlockedcounters 401 interlock each other in a case that they are connected,with reference to some timing charts.

As shown in FIG. 100, first, suppose that three interlocked counters 401a to 401 c are connected each other. Note that the interlocked counters401 a to 401 c are denoted as ICU in FIG. 100. An interlocking signalBLK0′ of each of interlocked counters 401 a to 401 c is inputted by alogic gate for interlocking signal 415 of the remaining interlockedcounters 401 a to 401 c. Therefore, the logic gate for interlockingsignal 415 has only to be a two-input logic gate. FIG. 101 shows atiming chart of either one of three interlocked counters 401 a to 401 cin a case that their operation is stabilized. Since all interlockedcounters 401 a to 401 c are symmetrical, timing charts of the remaininginterlocked counters 401 b and 401 c are similar to the above.

In a case that count numbers of all interlocked counters 401 a to 401 ccoincide with each other, as is clear by FIG. 101, an output of a logicgate for enable signal 416 becomes High level for a moment. However,since the output returns to Low level soon, a synchronous counter 411can count successively. All interlocked counters 401 a to 401 c, thus,can hold outputting the same count number.

When a waveform of the interlocking signal BLK1′ becomes short for somereason, as shown in FIG. 102, the interlocked counter 401 operatesregardless of the interlocking signal BLK1′. Therefore, the interlockingsignal BLK1′ does not influence the count number. Note that theinterlocked counter 401 generating the interlocking signal BLK1′operates as phase of the interlocking signal BLK1′ coincides with phasesof the interlocking signals, BLK0′ and BLK2′.

When a waveform of the interlocking signal BLK2′ becomes long for somereason, as shown in FIG. 103, the interlocked counter 401 operates asthe phase of the interlocking signal BLK0′ coincides with the phase ofthe interlocking signal BLK2′. The interlocked counter 401, thus, canhold outputting an end value as the count number until the interlockingsignal BLK2′ becomes L-level.

When a waveform of the interlocking signal BLK1′ becomes short for somereason, and a waveform of the interlocking signal BLK2′ becomes long forsome reason, as shown in FIG. 69, the interlocked counter 401 operatesas the phase of the interlocking signal BLK0′ coincides with the phaseof the interlocking signal BLK2′. The interlocked counter 401, thus, canhold outputting an end value as the count number until the interlockingsignal BLK2′ becomes L-level.

It is clear by the above timing charts that count numbers of threeinterlocked counters 401 a to 401 c coincide with the latest countnumber of them. This fact is also realized in a case that someinterlocked counters 401 whose end values are different form each otherare connected. Thus, even though the count numbers of three interlockedcounters 401 a to 401 c are different when a power is supplied, thecount numbers of the three interlocked counters 401 a to 401 c coincidewithin a time which is a product of a cycle of a clock signal and themaximum of the end values.

As shown in FIG. 96 and FIG. 98, now, the clock signal CLK is suppliedfrom an external part, in the enforcement forms of interlocked counter401 corresponding to the inventions described in claim 13 and claim 14.As is clear from FIG. 100, therefore, since each interlocked counter 401is separated from each other spatially, the clock signal CLK supplied tothe interlocked counter 401 does not always rise simultaneously, becauseof propagation delay time. Especially, in a case that some interlockedcounters 401 ara arranged on an LSI widely, phase of the clock signalCLK supplied to each interlocked counter 401 shifts certainly. It isexplained here about a method regulating the phase of the clock signalCLK, because the interlocked counter 401 itself generates the clocksignal CLK, instead of supplying the clock signal CLK from the externalpart.

As shown in FIG. 105, an enforcement form of an interlocked counter 401corresponding to the invention described in claim 15 consists of theenforcement form of the interlocked counter 401 corresponding to theinvention described in claim 13 and a synchronous oscillator 418.Similarly, as shown in FIG. 106, an enforcement form of an interlockedcounter 401 corresponding to the invention described in claim 16consists of the enforcement form of the interlocked counter 401corresponding to the invention described in claim 14 and the synchronousoscillator 418. In a case of FIG. 105, an enable signal P is distributedto a SYNC terminal of the synchronous oscillator 418, while a clocksignal CLK generated by the synchronous oscillator 418 is supplied to aCLK terminal of a synchronous counter 411, at a turning pint V. In acase of FIG. 106, the enable signal P is distributed to the SYNCterminal of the synchronous oscillator 418, while the clock signal CLKgenerated by the synchronous oscillator 418 is supplied to the CLKterminal of the synchronous counter 411, at a turning pint V1. Thesynchronous oscillator 418 is one for changing phase of the clock signalCLK, according to voltage of the SYNC terminal. It is explained hereabout the synchronous oscillator 418 in detail.

First, a synchronous oscillator 418 shown in FIG. 107 is a variation ofa ring oscillator, and consists of a latch circuit for synchronoussignal 431, two logic gates for oscillation 432 a and 432 b and a logicgate for amplifying clock signal 433. Note that the latch circuit forsynchronous signal 431 is a D latch, and the logic gates for oscillation432 a and 432 b and the logic gate for amplifying clock signal 433 areNOT gates. The latch circuit for synchronous signal 431 and the logicgates for oscillation 432 a and 432 b are wired circularly. That is, aQ′ terminal of the latch circuit for synchronous signal 431 is connectedwith an input terminal of the logic gate for oscillation 432 a, anoutput terminal of the logic gate for oscillation 432 a is connectedwith an input terminal of the logic gate for oscillation 432 b, and anoutput terminal of the logic gate for oscillation 432 b is connectedwith a D terminal of the latch circuit for synchronous signal 431 via aturning pint H. A SYNC terminal of the synchronous oscillator 418 isconnected with a G terminal of the latch circuit for synchronous signal431. In addition, the output terminal of the logic gate for oscillation432 b is connected with an input terminal of the logic gate foramplifying clock signal 433 via the turning pint H, and the logic gatefor amplifying clock signal 433 outputs a clock signal CLK. Note thatthe input terminal of the logic gate for amplifying clock signal 433 canbe connected with an output terminal of either the latch circuit forsynchronous signal 431, the logic gate for oscillation 432 a or thelogic gate for oscillation 432 b. In addition, some logic gates foramplifying clock signal 433 can be used, if desired. If the SYNCterminal is High level, the D terminal and the Q′ terminal of the latchcircuit for synchronous signal 431 work as an input terminal and anoutput terminal of a NOT gate, respectively. In short, a signal QS′outputted by the Q′ terminal of the latch circuit for synchronous signal431 inverts the output signal of the logic gate for oscillation 432 b.Otherwise, the Q′ terminal of the latch circuit for synchronous signal431 remains its present voltage in spite of voltage of the D terminal ofthe latch circuit for synchronous signal 431. The output signal of thelogic gate for oscillation 432 b is delayed by the signal QS′.Therefore, in a case that the SYNC terminal is High level, as shown inFIG. 108, the synchronous oscillator 418 self-oscillates. On the otherhand, in a case that the SYNC terminal is Low level, the synchronousoscillator 418 stops self-oscillating.

By the way, in a case of the synchronous oscillator 418 shown in FIG.107, since a period of its self-oscillation depends on switching time ofthe latch circuit for synchronous signal 431, the logic gate foroscillation 432 a and the logic gate for oscillation 432 b, all periodsof clock signals CLK generated by some synchronous oscillators 418 donot always coincide with each other. Suppose, therefore, that CMOS gatesare used as the latch circuit for synchronous signal 431, the logic gatefor oscillation 432 a and the logic gate for oscillation 432 b. Thesynchronous oscillator 418 can self-oscillate with a specific periodbecause a resistor for oscillation 434 a connects between turningpoints, I and J, and a capacitor for oscillation 435 connects betweenturning points, J and H, as shown in FIG. 109. Note that a resistance ofthe resistor for oscillation 434 a denotes R ohms, and a capacitance ofthe capacitor for oscillation 435 denotes C farads. In addition, aresistor for oscillation 434 b is a protection resistor, and aresistance of the resistor for oscillation 434 b denotes R0 ohms.

Next, a synchronous oscillator 418 shown in FIG. 110 is a variation ofan astable multi-vibrator, and consists of a latch circuit forsynchronous signal 431, a logic gate for oscillation 432, two resistorsfor oscillation 434 a and 434 b, two capacitors for oscillation 435 aand 435 b and a logic gate for amplifying clock signal 433. Note thatthe latch circuit for synchronous signal 431 is a D latch, and the logicgate for oscillation 432 is a NAND gate, and the logic gate foramplifying clock signal 433 is a NOT gate. The latch circuit forsynchronous signal 431, the logic gate for oscillation 432 and thecapacitors for oscillation 435 a and 435 b are wired circularly. Thatis, a Q′ terminal of the latch circuit for synchronous signal 431 isconnected with a terminal of the capacitor for oscillation 435 b via aturning point H, another terminal of the capacitor for oscillation 435 bis connected with all input terminals of the logic gate for oscillation432 via a turning point J, an output terminal of the logic gate foroscillation 432 is connected with a terminal of the capacitor foroscillation 435 a via turning points, K1 and K2, and another terminal ofthe capacitor for oscillation 435 a is connected with a D terminal ofthe latch circuit for synchronous signal 431 via a turning pint L.Moreover, the resistor for oscillation 434 a connects between theturning points, L and H, and the resistor for oscillation 434 b connectsbetween the turning points, J and K2. Note that resistances of both theresistor for oscillation 434 a and the resistor for oscillation 434 bdenote R ohms, and capacitances of both the capacitor for oscillation435 a and the capacitor for oscillation 435 b denote C farads. A SYNCterminal of the synchronous oscillator 418 is connected with a Gterminal of the latch circuit for synchronous signal 431. In addition,the output terminal of the logic gate for oscillation 432 is connectedwith an input terminal of the logic gate for amplifying clock signal433, and the logic gate for amplifying clock signal 433 outputs a clocksignal CLK. Note that the input terminal of the logic gate foramplifying clock signal 433 can be connected with an output terminal ofeither the latch circuit for synchronous signal 431 or the logic gatefor oscillation 432. In addition, some logic gates for amplifying clocksignal 433 can be used, if desired. A timing chart of the synchronousoscillator 418 is similar with FIG. 108.

It has been described above about some synchronous oscillators 418repeating self-oscillating and stopping, by changing voltage of the SYNCterminal. Since the synchronous oscillators 418 do not generateunnecessary pulses for the clock signal CLK, it is convenient for theinterlocked counter 401 to control synchronous circuits. However, sincethere is a case that a period of the clock signal CLK becomes muchlonger than a period of self-oscillation of the synchronous oscillators418, such a clock signal is not very convenient for an electroniccircuit, in which a jitter of the clock signal CLK causes a trouble.Therefore, it is finally explained about a synchronous oscillator 418such that it remains self-oscillating.

A synchronous oscillator 418 shown in FIG. 111 consists of a flip-flopcircuit for synchronous signal 436, a synchronous signal amplifier 437,a loop filter 438, a voltage controlled oscillator 439 and a logic gatesfor amplifying clock signal 433. Note that the flip-flop circuit forsynchronous signal 436 is a D latch, the synchronous signal amplifier437, the logic gate for amplifying clock signal 433 are NOT gates, theloop filter 438 is a lag-type loop filter and the voltage controlledoscillator 439 is a variation of a Colpitz oscillator.

The flip-flop circuit for synchronous signal 436 memorizes voltage of aSYNC terminal of the synchronous oscillator 418 inputted at its Dterminal, synchronizing with a clock signal CLK outputted by the logicgate for amplifying clock signal 433, followed by outputting the voltageas a signal QS. The synchronous signal amplifier 437 inverts the signalQS, followed by outputting a signal SA′.

The loop filter 438 consists of a resistor for loop filter 441 and acapacitor for loop filter 442. After a high-frequency noise includedwithin the signal SA′ was removed by the capacitor for loop filter 442,the loop filter 438 outputs a signal VC from a turning point N. Notethat a resistance of the resistor for loop filter 441 denotes R3 and acapacitance of the capacitor for loop filter 442 denotes C3. Inaddition, a frequency band of the noise removed is decided by a timeconstant R3C3.

The voltage controlled oscillator 439 consists of the logic gate foroscillation 432, a crystal oscillator 443, a variable diode 444, threeresistors for oscillation 434 a to 434 c and two capacitors foroscillation 435 a and 435 b. The crystal oscillator 443, the capacitorsfor oscillation 435 a and 435 b and the variable diode 444 are wiredcircularly. That is, an anode terminal of the variable diode 444 isconnected with a ground, a cathode terminal of the variable diode 444 isconnected with a terminal of the capacitor for oscillation 435 a at aturning point H, another terminal of the capacitor for oscillation 435 ais connected with a terminal of the crystal oscillator 443 at a turningpoint J1, another terminal of the crystal oscillator 443 is connectedwith a terminal of the capacitor for oscillation 435 b at a turningpoint K, another terminal of the capacitor for oscillation 435 b isconnected with the ground. An LC circuit is formed by this fact. Aterminal of the crystal oscillator 443 is connected with an inputterminal of the logic gate for oscillation 432 at turning points, J1 andJ2, and the resistor for oscillation 434 b connects an output terminalof the logic gate for oscillation 432 and another terminal of thecrystal oscillator 443 at turning points, L and K. Therefore, amplitudeof the crystal oscillator 443 is amplified. The resistor for oscillation434 a connects an input terminal and an output terminal of the logicgate for oscillation 432 at turning points, L and J2. Therefore, anelectric current is supplied to the input terminals of the logic gatefor oscillation 432, the crystal oscillator 443 and the capacitor foroscillation 435 a from the output terminal of the logic gate foroscillation 432. A terminal of the resistor for oscillation 434 c inputsa signal VC, another terminal of the resistor for oscillation 434 c isconnected with the cathode terminal of the variable diode 444 at theturning point H. The resistor for oscillation 434 c is a protectionresistor, and can apply voltage of the signal VC to the cathode terminalof the variable diode 444. If the voltage of the signal VC is high,capacitance of the variable diode 444 becomes small. Therefore,frequency of self-oscillation of the voltage controlled oscillator 439becomes high. On the other hand, if the voltage of the signal VC is nearby zero volt, the capacitance of the variable diode 444 becomes large.Therefore, the frequency of self-oscillation of the voltage controlledoscillator 439 becomes low. Note that resistances of the resistors foroscillation 434 a to 434 c denote R1, R2, and R0 ohms, respectively, andcapacitances of the capacitor for oscillation 435 a and 435 c denote C1and C2 farads, respectively.

The logic gate for amplifying clock signal 433 inputs a waveform ofself-oscillation outputted by the voltage controlled oscillator 439 fromthe turning point L, followed by outputting the clock signal CLKamplified in the shape of a rectangle wave. The clock signal CLK isdistributed to a clock terminal the flip-flop circuit for synchronoussignal 436 at a turning point M. Some logic gates for amplifying clocksignal 433 can be used, if desired.

As shown in FIG. 112, then, the synchronous oscillator 418 in FIG. 111can make a period of the clock signal CLK short when voltage of the SYNCterminal is high. Therefore, the synchronous oscillator 418 can regulatephase of the clock signal CLK finely. If the voltage controlledoscillator 439 can make its frequency twice, difference of phases ofclock signals generated by adjoining interlocked counters 401 is put inπ radian, that is, less than a half period of the clock signals. Notethat a lag-lead-type loop filter and its variations can be used insteadof the lag-type loop filter, although the lag-type loop filter is usedas the loop filter 438 in FIG. 111. In addition, many voltage controlledoscillators 439 can be used instead of the voltage controlled oscillator439 shown in FIG. 111. In this case, output voltage of the synchronoussignal amplifier 437 must be changed, according to a range of voltagecontrolling the voltage controlled oscillator 439. Although a NOT gateis used as the synchronous signal amplifier 437 in FIG. 111, anoperational amplifier is used, if desired.

Now, the enforcement forms of the interlocked counter 401 correspondingto the inventions described in claim 13 to claim 16 do not always haveto be connected with all other interlocked counters 401. It is explainedhere about a case that the interlocked counters 401 are arrangedregularly.

As shown in FIG. 113, an enforcement form of an interlocked counter 401corresponding to the invention described in claim 17 is a networkconnecting adjoining interlocked counters 401 arranged in the shape of asquare lattice with each other. In this case, the number of latchcircuits for interlocking signal 414 is four. Note that some inputs ofthe latch circuits for interlocking signal 414 which are not connectedare pulled down, in an interlocked counter 401 near an edge. As shown inFIG. 114, the interlocked counters 401 can be arranged in the shape of ahexagonal lattice and can be connected with each other, instead ofarranging them in the shape of a square lattice. Since all lengths ofsignal lines for interlocking signals become almost same, by arrangingthe interlocked counters 401 like this, it becomes easy for theinterlocked counters 401 to interlock with each other. For a large-scaleand regular digital circuit 402 like a pipeline processing device, a DSP(Digital Signal Processor), a systric array, a data-flow processor and aparallel image processing device, these two-dimensional interlockeddevices can supply easily the count number of the interlocked counter401, that is, a divided signal of a clock signal.

As shown in FIG. 116, in addition, a three-dimensional interlockeddevice is a network piling up some interlocked counters 401 arranged inthe shape of a square lattice and in the shape of a hexagonal lattice by3D LSI technology. In a case of arranging the interlocked counters 401in the shape of a square lattice, the number of the latch circuits forinterlocking signal 414 is six. In a case of arranging them in the shapeof a hexagonal lattice, the number of the latch circuits forinterlocking signal 414 is eight. In a case of FIG. 116, three networksof the interlocked counters 401 arranged in the shape of a squarelattice are stacked, and an interlocking signal of each interlockedcounter 401 is represented by a real line. Note that some of inputterminals of the latch circuit for interlocking signal 414 of eachinterlocked counter 401, which are not connected with adjoininginterlocked counters 401, are pulled up or pulled down. As is clear fromFIG. 116, length of signal lines for interlocking signals comes to beequal and the shortest, by uniting positions of interlocked counters 401between layers each other. Therefore, propagation delay time of theinterlocking signals across the layers can be regulated easily as itcomes to be equal to propagation delay time of the interlocking signalswithin each layer, by changing a material of wires between the layers,or by using some delay lines. Thus, the interlocked counters 401 indifferent layers can be synchronized with each other.

As shown in FIG. 117, furthermore, an interlocked device fordistributing the count number comprises a network of the interlockedcounters 401 arranged in the shape of a square lattice and a hexagonallattice, digital circuits 402 like a processor 101 and an operationcircuit, and analog circuits 403 like a photo diode and an A/D convert204 in some different layers of a 3D LSI, respectively. In a case ofFIG. 117, some interlocked counters 401 arranged in the shape of asquare lattice are implemented in a second layer and a fifth layer,digital circuits 402 are implemented in a first layer, a third layer anda fourth layer, and analog circuits 403 are implemented in a sixthlayer. In FIG. 117, note that a real line denotes the interlockingsignal, and a dashed line denotes the count number. In addition, signallines except the interlocking signal and the count number are omitted.Since some of interlocked counters 401 implemented in the second layerand the fifth layer, which are overlapping each other, input mutualinterlocking signals, all interlocked counters 401 in the second layerand the fifth layer can generate the same count number. Moreover, sincethe network of the interlocked counters 401 can be implemented in alayer different from layers of the digital circuits 402 and the analogcircuits 403, arrangement of the interlocked counters 401 is not shiftedbecause of arrangement of the digital circuits 402 and the analogcircuits 403, The signal line of the interlocking signal does not alsodetour. In addition, the interlocked counters 401 are not influenced bynoise of the digital circuits 402 and the analog circuits 403, by copingwith the noise between layers of the three-dimensional LSI. Therefore,operation of the interlocked circuits 401 is stabilized. Similarly, thedigital circuits 402 and the analog circuits 403 can input the countnumber from the nearest interlocked counter 401 regardless of theirplaces. This fact means that an LSI designer does not have to drawsignal lines of the count number around within an implementation layer.Therefore, even though the LSI designer arranges the digital circuits402 and the analog circuits 403 at any places, he can pull propagationdelay time of the count number within a specific range. Thus, thedigital circuits 402 and the analog circuits 403 can be designed easily.In particular, the network of the interlocked counters 401 like FIG. 117can supply efficiently the count number, that is, a divided signal ofthe clock signal CLK, to a systric array and a parallel image processingdevice, in which processors 101 arranged in the shape of a squarelattice and a hexagonal lattice pass data processed simultaneouslytoward a vertical direction, in terms of pipeline processing.

By the way, all interlocked counters 401 can supply the same countnumber for a whole LSI, by using a claim 17, a three-dimensionalinterlocked device and an interlocked device for distributing the countnumber. In short, by using this count number, an interlocked signaldistribution circuit can be designed as a suitable signal is distributedfor a whole LSI simultaneously.

As shown in FIG. 118, the interlocked device generates some decodedresults, by decoding the count number of the interlocked counter 401 bya decoder for signal distribution 451. Suppose, moreover, that two ofthe decoded results represent a count start time and a count end time,respectively. In a case that a latch circuit for signal distribution 452inputted a suitable signal SIGIN, the latch circuit for signaldistribution 452 memorizes the signal SIGIN from an input time to thecount end time, followed by that a logic gate for signal distribution453 outputs the signal SIGIN memorized by the latch circuit for signaldistribution 452 to a flip-flop circuit for signal distribution 454 onlyat the count start time. Moreover, the flip-flop circuit for signaldistribution 454 outputs a signal SIGOUT and a signal SIGOUT′synchronized with a clock signal CLK. Therefore, the interlocked signaldistribution circuit generates the signal SIGOUT from the signal SIGINdelayed any time. Note that the signal SIGOUT is synchronized with theclock signal CLK and is active for an integral multiple of a period ofthe clock signal CLK.

For example, in a case of FIG. 118, the decoder for signal distribution451 inputs three outputs of the interlocked counter 401, QA to QC,representing the count numbers, 0 to 7, and their negative-logicoutputs, QA′ to QC′, followed by generating eight decoded results fromthe count numbers, 0 to 7, respectively, by using eight NOR gates. Thatis, eight NOR gates comprise some (now three) input terminals,respectively. The outputs, QA, QB and QC, are distributed to the NORgate outputting the decoded result 0, the outputs, QA′, QB and QC, aredistributed to the NOR gate outputting the decoded result 1, theoutputs, QA, QB′ and QC, are distributed to the NOR gate outputting thedecoded result 2, the outputs, QA′, QB′ and QC, are distributed to theNOR gate outputting the decoded result 3, the outputs, QA, QB and QC′,are distributed to the NOR gate outputting the decoded result 4, theoutputs, QA′, QB and QC′, are distributed to the NOR gate outputting thedecoded result 5, the outputs, QA, QB′ and QC′, are distributed to theNOR gate outputting the decoded result 6, and the outputs, QA′, QB′ andQC′, are distributed to the NOR gate outputting the decoded result 7.Suppose here that any two selected from the decoded results 0 to 7denote the count start time and the count end time, respectively. A timefrom when the count start time became High level to when the count endtime becomes High level is either zero to seven times of a period of theclock signal CLK. Moreover, eight NOT gates inputs the decoded result 0to the decoded result 7, respectively, followed by outputtingnegative-logic decoded results, 0′ to 7′, respectively. Therefore, thecount start time and the count end time can be represented in negativelogic, by using the negative-logic decoded results, 0′ to 7′.

In a case of FIG. 118, now, the count start time is the negative-logicdecoded result 3′, and the count end time is the negative-logic decodedresult 5′. In order for the interlocked signal distribution circuit togenerate the signal SIGOUT from the signal SIGIN delayed any time, byusing the negative-logic decoded result 3′ and the negative-logicdecoded result 5′, the latch circuit for signal distribution 452 firstinputs the signal SIGIN at one of two input terminals, followed byoutputting a signal QS′. The logic gate for signal distribution 453inputs the signal QS′ and the negative-logic decoded result 5′ at twoinput terminals, followed by outputting a signal J3. The flip-flopcircuit for signal distribution 454 inputs the signal J3 at a J terminaland the decoded result 5 at a K terminal. In addition, since the clocksignal CLK is inputted at a clock terminal of the flip-flop circuit forsignal distribution 454, the flip-flop circuit for signal distribution454 outputs the signal SIGOUT from a Q terminal, synchronizing withfalling of the clock signal CLK, followed by outputting the signalSIGOUT′ from a Q′ terminal. Finally, the signal SIGOUT is distributed toanother of two input terminals of the latch circuit for signaldistribution 452 at a turning point Y. It is explained here about theinterlocked signal distribution circuit shown in FIG. 118, withreference to a timing chart of FIG. 119.

First, when the signal SIGIN became High level, the latch circuit forsignal distribution 452 makes the signal QS′ Low level. After this, eventhough the signal SIGIN became Low level, the signal QS′ remains Lowlevel until the signal SIGOUT becomes Low level. After the signal QS′became Low level, the logic gate for signal distribution 453 makes thesignal J3 High level, only if the negative-logic decoded result 3′ isLow level. In short, after the signal SIGOUT became High level, thesignal J3 becomes High level if the count number of the interlockedcounter 401 arrived at three. Since the J terminal of the flip-flopcircuit for signal distribution 454 becomes High level, the signalSIGOUT becomes High level in falling of the clock signal CLK. Inaddition, since the signal SIGOUT is inputted by the latch circuit forsignal distribution 452, the latch circuit for signal distribution 452is resetted, and the signal QS′ becomes High level. Even though thecount number of the interlocked counter 401 arrived at four in thisstate, both the J terminal and the K terminal of the flip-flop circuitfor signal distribution 454 become Low level. Therefore, the signalSIGOUT remains High level. However, when the count number of theinterlocked counter 401 arrived at five, the decoded result 5 becomesHigh level, and the K terminal of the flip-flop circuit for signaldistribution 454 also becomes High level. In short, the signal SIGOUTbecomes Low level in falling of the clock signal CLK. As is clear fromFIG. 119, when the signal SIGIN was inputted, the signal SIGOUT has beenoutputted from a time that the clock signal CLK fell during the decodedresult 3′ is Low level, to a time that the clock signal CLK fell duringthe decoded result 5 is High level. Even though digital circuits 402 arearranged anywhere in an LSI, the digital circuits 402 can input thesignal SIGOUT certainly in rising of the decoded result 5. Such functionis necessary to implement a reset signal, an interrupt signal and someinput-output signals into a system LSI, with seldom changing the digitalcircuits 402 already designed.

Besides this, as shown in FIG. 120, the decoded result 5 can be alsodistributed to another terminal of two input terminals of the latchcircuit for signal distribution 452 in the interlocked signaldistribution circuit at a turning point Z. In a case of the interlockedsignal distribution circuit shown in FIG. 118, the latch circuit forsignal distribution 452 is resetted by the signal SIGOUT. When thesignal SIGOUT is High level, therefore, the latch circuit for signaldistribution 452 can not memorize the signal SIGIN even though thesignal SIGIN became High level. On the other hand, in a case of theinterlocked signal distribution circuit shown in FIG. 120, the latchcircuit for signal distribution 452 is resetted by the decoded result 5.When the signal SIGOUT is High level, therefore, the latch circuit forsignal distribution 452 can memorize the signal SIGIN if the decodedresult 5 is not High level, even though the signal SIGIN became Highlevel. In short, if the signal SIGIN became High level immediately afterthe decoded result 5 changed from High level to Low level, the latchcircuit for signal distribution 452 can memorize the signal SIGIN.Therefore, if the decoded result 4 is inputted at another terminal oftwo input terminals of the latch circuit for signal distribution 452instead of the decoded result 5, the latch circuit for signaldistribution 452 can come to memorize the signal SIGIN even though thesignal SIGOUT is High level.

Note that NAND gates can be also used although NOR gates are used as thedecoder for signal distribution 451, the latch circuit for signaldistribution 452 and the logic gate for signal distribution 453 in FIG.118 and FIG. 120. Furthermore, the negative-logic decoded result 3′ andthe negative-logic decoded result 5′ are used in FIG. 118 and FIG. 120,in order to represent the count start time and the count end time,respectively. Of course, however, other decoded results andnegative-logic decoded results can be also used. Suppose that a suitablesignal SIGIN is inputted from an external part. After the latch circuitfor signal distribution 452 once memorized this signal, the signal isinputted by the flip-flop circuit for signal distribution 454 at thecount start time, according to the logic gate for signal distribution453. The flip-flop circuit for signal distribution 454 memorizes aninput signal, synchronizing with the clock signal, followed by beingresetted at the count end time. Therefore, the interlocked signaldistribution circuit can output the input signal arrived before thecount start time, from the count start time to the count end time, inspite of propagation delay time of the input signal. In a case thatlogic of the input signal is inverting, note that the interlocked signaldistribution circuit can work normally, by adding a logic gate in frontof the latch circuit for signal distribution 452.

It has been described above about the interlocked device. It isexplained here about an enforcement form of an image sensor 251 in thepresent invention, with reference to the drawings.

As shown in FIG. 121 and FIG. 122, the image sensor 251 in the presentinvention comprises some sensor modules 252, and each of the sensormodules 252 outputs a pixel signal. In short, the image sensor 252 canoutput the same number of pixel signals as the number of the sensormodules 252 in parallel. If each of the sensor modules 252 outputs onlya pixel signal, the image sensor 251 is equivalent to the pastpixel-parallel type. Note that a sensor module 252 is denoted as SM inFIG. 121 and FIG. 122, and an interval between adjoining sensor modules252 is stretched for making the figures legible. In addition, somesensor modules 252 are arranged in the shape of a lattice in FIG. 121,while some sensor modules 252 are arranged in the shape of a hexagonallattice in FIG. 122. Besides this, some sensor modules 252 can bearranged in the shape of a line and a circle. Moreover, some sensormodules 252 can be arranged at any places. It is explained here about amethod that a sensor module 252 outputs some pixel signals in order, inboth cases that the image sensor 251 uses charge coupled device 263 andthe image sensor 251 is manufactured by using only CMOS technology.

First, in a case that the image sensor 251 uses the charge coupleddevice 263, a pixel cell 253 taking a pixel consists of a photo-receptorelement 261 and a charge transfer gate 262 at least. A photodiode, aphototransistor and a HARP (High-gain Avalanche Rushing amorphousPhotoconductor) film are used as the photo-receptor element 261, and acapacitor storing charges and a semiconductor switch are added to thephoto-receptor element 261, if desired. The charge transfer gate 262 isa semiconductor switch, and the charge transfer gate 262 is conductivewhen a column selection signal is inputted by the pixel cell 253.Therefore, the charges stored by the photo-receptor element 261 aretaken out from the pixel cell 253. As shown in FIG. 124, then, in anenforcement form of the image sensor 251 corresponding to the inventiondescribed in claim 18, some pixel cells 253 are arranged in the shape ofa lattice in the sensor module 252. The charge coupled device 263 isarranged sigmoidly as all pixel cells 253 are traced with one stroke inFIG. 124, and an output terminal of the charge transfer gate 262 in eachof the pixel cells 253 is connected with the charge coupled device 263.In addition, a drive device for charge transfer 264 supplies columnselection signals to the charge transfer gates 262 of all pixel cells253 via at least one column selection signal line 265. Moreover, thedrive device for charge transfer 264 supplies charge transfer signals tothe charge coupled device 263 via at least one charge transfer signalline 266. The drive device for charge transfer 264, then, makes chargestransferred from at least one photo-receptor element 261 to the chargecoupled device 263 transfer to either terminal, in a form of a bucketrelay. The charges transferred by the charge coupled device 263 areinputted by an output amplifier 267 in order. The output amplifier 267converted the charges inputted into voltage, followed by outputting itas the pixel signal. Note that the drive device for charge transfer 264can make only one column selection signal active at once, according toapplications of the image sensor 251, but now the drive device forcharge transfer 264 can mainly make all column selection signals activesimultaneously. Therefore, since the charge coupled device 263 cantransfer the charges stored by all photo-receptor elements 261 in order,in a form of a bucket relay, the sensor module 252 can take out easilythe charges from all photo-receptor elements 261 in a short time,followed by outputting them as the pixel signal. Moreover, after thedrive device for charge transfer 264 supplied the charge transfersignals to the charge coupled device 263 via at least one chargetransfer signal line 266, the drive device for charge transfer 264outputs pixel synchronization signals. From an external part of allsensor modules 252, therefore, it can be distinguished that each sensormodule 252 outputs its pixel signal.

By the way, although the charge coupled device 263 is arranged sigmoidlyin FIG. 124, the charge coupled device 263 can be arranged in the shapeof a spiral, as shown in FIG. 125. Moreover, in a case that some pixelcells 253 are arranged in the shape of a hexagonal lattice, the chargecoupled device 263 can be arranged in the shape of a spiral, as shown inFIG. 126. Note that a pixel cell 253 is denotes PC in FIG. 126. In thesensor modules 252, since the charge coupled device 263 can take outcharges in order, from a photo-receptor element 261 of a pixel cell 253at an edge or a photo-receptor element 261 of a pixel cell 253 at acenter, the image sensor 251 can change its resolution easily, only bylimiting the number of pixel signals received by an electronic circuitreceiving some pixel signals from the sensor modules 252.

Next, in a case that the image sensor 251 is manufactured by using onlyCMOS technology, a pixel cell 253 taking a pixel consists of aphoto-receptor element 261, a charge amplifier 271 and a columnselection gate 272 at least. A photodiode, a phototransistor and a HARPfilm are used as the photo-receptor element 261, and a capacitor storingcharges and a semiconductor switch are added to the photo-receptorelement 261, if desired. The column selection gate 272 is asemiconductor switch, and the column selection gate 272 is conductivewhen a column selection signal is inputted by the pixel cell 253.Therefore, the charges stored by the photo-receptor element 261 aretaken out from the pixel cell 253. As shown in FIG. 128, then, in anenforcement form of the image sensor 251 corresponding to the inventiondescribed in claim 19, some pixel cells 253 are arranged in the shape ofa lattice in the sensor module 252. As is clear from FIG. 128,construction of the sensor module 252 is equivalent to construction ofan image sensor 251 using a general CMOS technology. Nine pixel cells253 are arranged on a 3×3 matrix in FIG. 128. In addition, a 3-stage1-bit cyclic shift register is used as a vertical shift register 273 anda horizontal shift register 274, only one of whose outputs is active,respectively. Moreover, when the horizontal shift register 274 did theround, the vertical shift register 273 shifts one time. Therefore, oneof nine pixel cells 253 can be selected by combining the vertical shiftregister 273 and the horizontal shift register 274. Details are asbelow.

First, in a case that the vertical shift register 273 made a columnselection signal on a first column active, the column selection gates272 in three pixel cells 253 on the first column are conductive.Therefore, after charges stored by the photo-receptor element 261 ineach of the three pixel cells 253 are converted into voltage by thecharge amplifier 271, the voltage is outputted from an output terminalof the column selection gate 272. In short, only the voltage outputtedby the three pixel cells 253 on the first column is inputted by threenoise cancellers 275 via three vertical signal lines 278, respectively.On the other hand, in each of six pixel cells 253 on a second column anda third column, the photo-receptor elements 261 are storing theircharges. CDS (Correlation Double Sampling) is used as a noise canceller275 on each row, in order to reduce noise generated by the chargeamplifier 271 and the column selection gate 272 in the three pixel cells253 on the same column. In a case that the horizontal shift register 274made a row selection signal on a first row active, voltage outputted bythe noise canceller 275 on the first row is inputted by the outputamplifier 267. After the output amplifier 267 amplifies the voltage, theoutput amplifier 267 outputs a pixel signal corresponding to the pixelcell 253 on the first column and the first row. Similarly, in a casethat the horizontal shift register 274 made row selection signals on asecond row and a third row active, the output amplifier 267 outputspixel signals corresponding to the pixel cells 253 on the first columnand the second row, and on the first column and the third row,respectively. Note that the horizontal shift register 274 outputs apixel synchronization signal after selecting a row. From an externalpart of the sensor module 252, therefore, it can be distinguished thatthe output amplifier 267 outputs the pixel signals. Next, if outputs ofthe horizontal shift register 274 did the round, the vertical shiftregister 273 makes a column selection signal on the second columnactive. Finally, the vertical shift register 273 makes a columnselection signal on the third column active. After that, the verticalshift register 273 makes the column selection signal on the first columnactive if the outputs of the horizontal shift register 274 did theround. Therefore, since the vertical shift register 273 and thehorizontal shift register 274 can select all pixel cells 253 in order,the sensor module 252 can output all pixel signals.

Although nine pixel cells 253 are arranged in the shape of a lattice inFIG. 128, some pixel cells 253, of course, can be arranged in the shapeof a hexagonal lattice. In this case, the column selection signal lines265 and row selection signal lines 277, and vertical signal lines 278and horizontal signal lines 279 are wired zigzag, respectively, or theyare wired as they intersect in an angle of 120 degrees.

Finally, columns and rows of a sensor module 252 change places, byrotating the sensor module 252 90 degrees. Of course, the vertical shiftregister 273 and the horizontal shift register 274 also changes placessimilarly. Therefore, an image sensor 251 whose columns and rows changeplaces is included in the enforcement forms of the image sensor 251corresponding to the inventions described in claim 18 and claim 19.

It has been described above about a case that some sensor modules 252are implemented on an implementation surface of an LSI. With a naturalthing, signal lines for pixel signal and signal lines for pixelsynchronization signal outputted from each of the sensor modules 252 arealso wired on the same implementation surface. In this case, however,wire length of the signal lines for pixel signal and wire length of thesignal lines for pixel synchronization signal are different from eachother, according to a place of the sensor modules 252 implemented in theimage sensor 251. In addition, quantity of openings of allphoto-receptor elements 261 is dropped. It is explained here about animage sensor 251, in which all pixel signals and pixel synchronizationsignals are outputted toward a back surface of the image sensor 251.

As shown in FIG. 129 and FIG. 130, first, each of all sensor modules 252outputs the pixel signal and the pixel synchronization signal from theback of the image sensor 251. Lines for the pixel signal and lines forthe pixel synchronization signal are realized in terms ofthree-dimensional LSI technology, where holes are made in a substrate ofthe image sensor 251 and metals like copper are filled in the holes. Asis clear from FIG. 129 and FIG. 130, a designer of the image sensor 251can make the wire length of the signal lines for all pixel signals andthe wire length of the signal lines for all pixel synchronizationsignals outputted from all sensor modules 252 equal. In addition, sincethe designer does not have to wire the signal lines for the pixelsignals and the signal lines for the pixel synchronization signals onthe implementation surface of the sensor modules 252, the designer canmake an implementation area of the sensor module 252 small. Moreover, hecan make an interval between adjoining sensor modules 252 narrow.Therefore, the designer can arrange many sensor modules 252 in the imagesensor 251.

By the way, a sensor module 252 itself consists of some layers, by usingthe three-dimensional LSI technology. For example, as shown in FIG. 131,a sensor module 252 consists of a first layer, a second layer and athird layer. In the first layer, a charge coupled device 263 is arrangedsigmoidly. In the second layer, some (now nine) charge transfer gates262 arranged in the shape of a lattice, a drive device for chargetransfer 264 and a output amplifier 267 are implemented. In the thirdlayer, some (now nine) photo-receptor elements 261 are arranged in theshape of a lattice. Some signal lines are wired as below, in the sensormodule 252. Note that a power line, a ground line, a clock signal line,a reset signal line and so on are omitted in FIG. 131.

First, in the second layer, some (now three) column selection signallines 265 are wired as they penetrate some (now three) charge transfergates 262 on each column, respectively. Moreover, at least one chargetransfer signal line 266 is wired sigmoidly along all charge transfergates 262. Next, in the first layer, the charge coupled device 263 isarranged sigmoidly along the charge transfer gates 262. Here, the secondlayer is stacked on the first layer as the charge transfer signal line266 overlaps with the charge coupled device 263, and some signal linesare wired toward a top surface of the charge coupled device 263 from thecharge transfer signal line 266. Moreover, some signal lines are wiredtoward a side surface of the charge coupled device 263 from each of thecharge transfer gates 262. Next, a signal line is wired from a terminalof the charge coupled device 263 in the first layer toward the outputamplifier 267 in the second layer, and the output amplifier 267 outputsit. Similarly, a signal line for the pixel synchronization signaloutputted by the drive device for charge transfer 264 penetrates thefirst layer. Finally, the third layer is stacked on the second layer aseach of all photo-receptor elements 261 overlaps with the correspondingcharge transfer gates 262, and a signal line is wired from each of allphoto-receptor elements 261 toward the corresponding charge transfergates 262. Therefore, in a sensor module 252, not only total wire lengthof the signals become short, but also quantity of openings of thephoto-receptor elements 261 becomes high. In addition, allphoto-receptor elements 261 can be arranged even in the image sensor251.

Note that the designer of the image sensor 251 can combine some kinds ofLSI manufacturing technology easily because the charge coupled device263 is implemented in a layer which is different from a layer whichimplemented the photo-receptor elements 261, the drive device for chargetransfer 264 and so on, as shown in FIG. 131. In addition, the designercan increase a yield of the image sensor 251, by stacking some sensormodules 252 already checked on the substrate of the image sensor 251, inthe shape of a lattice. Suppose, moreover, that some delay lines areused as all charge transfer signal lines 266, and that the drive devicefor charge transfer 264 supplies with a pulse signal from a terminal ofthe charge coupled device 263 connected with the output amplifier 267.Since a charge transfer signal is propagated in order from the terminalof the charge coupled device 263 connected with the output amplifier 267toward another terminal, charges stored by the charge coupled device 263are transmitted toward the terminal of the charge coupled device 263connected with the output amplifier 267, in a form of a bucket relay.

As shown in FIG. 132, in addition, a sensor module 252 consists of afirst layer, a second layer and a third layer. In the first layer, some(now nine) column selection gates 272 arranged in the shape of alattice, a vertical shift register 273, a horizontal shift register 274,some (now three) noise cancellers 275, some (now three) row selectiongates 276 and an output amplifier 267 are implemented. In the secondlayer, some (now nine) charge amplifiers 271 are arranged in the shapeof a lattice. In the third layer, some (now nine) photo-receptorelements 261 are arranged in the shape of a lattice. In the sensormodule 252, some signal lines are wired as below. Note that a powerline, a ground line, a clock signal line, a reset signal line and so onare omitted in FIG. 132.

First, in the first layer, some (now three) column selection signallines 265 are wired as they penetrate some (now three) column selectiongates 272 on each column, respectively, from the vertical shift register273. Moreover, some (now three) vertical signal lines 278 are wiredtoward some noise cancellers 275, respectively, as they penetrate some(now three) column selection gates 272 on each row, respectively. Next,some signal lines are wired from the noise cancellers 275 toward somerow selection gates 276 on each row, respectively. Moreover, some (nowthree) row selection signal lines 277 are wired from the horizontalshift register 274 toward the row selection gates 276. In addition, ahorizontal signal line 279 is wired as it penetrates the row selectiongates 276 toward the output amplifier 267. Here, the second layer isstacked on the first layer as each of all charge amplifiers 271 overlapswith the corresponding column selection gate 272. A signal line is wiredfrom each of the charge amplifiers 271 toward a top surface of thecorresponding column selection gate 272. Next, a signal line for a pixelsignal outputted by the output amplifier 267 arrives at a back of thefirst layer. Similarly, a signal line for a pixel synchronization signaloutputted by the horizontal shift register 274 arrives at a back of thefirst layer. Finally, the third layer is stacked on the second layer aseach of all photo-receptor elements 261 overlaps with the correspondingcharge amplifier 271. A signal line is wired from each of allphoto-receptor elements 261 toward the corresponding charge amplifier271. In a sensor module 252, therefore, not only total wire length ofthe signals become short, but also quantity of openings of thephoto-receptor elements 261 becomes high. In addition, allphoto-receptor elements 261 can be arranged even in the image sensor251.

Now, it has been described above about the image sensor 251, in whichall sensor modules 252 output some pixel signals and some pixelsynchronization signals from a back, by using the three-dimensional LSItechnology. It is explained here about an image sensor 251, in whichsome digital circuits 402 convert pixel signals outputted by all sensormodules 252 into some pixel data after the digital circuits 402 processthe pixel data in parallel.

As shown in FIG. 133, an enforcement form of an image sensor 251corresponding to the invention described in claim 20 consists of a firstlayer, a second layer and a third layer. In the first layer, somedigital circuits 402 arranged in the shape of a two-dimensional latticeare implemented. In the second layer, some A/D converters 204 arearranged in the shape of a two-dimensional lattice. In the third layer,some sensor modules 252 are arranged in the shape of a two-dimensionallattice. All of the A/D converters 204 are stacked on the correspondingdigital circuits 402, respectively. Moreover, all of the sensor modules252 are stacked on the corresponding A/D converters 204, respectively.In addition, a signal line for a pixel signal is wired from each of allsensor modules 252 toward the corresponding A/D converter 204, and nlines sending a n-bit pixel datum are wired from each of all A/Dconverters 204 toward the corresponding digital circuit 402. Moreover, asignal line for a pixel synchronization signal is wired from each of allsensor modules 252 toward the corresponding digital circuit 402.Therefore, all these lines do not cross each other, and all A/Dconverters 204 always convert the pixel signal into the n-bit pixeldatum independently. In FIG. 133, All digital circuits 402, all A/Dconverters 204 and all sensor modules 252 are arranged in the shape of alattice, respectively. Of course, however, note that these are arrangedin the shape of a hexagonal lattice. Moreover, note that a power line, aground line, a clock signal line, a reset signal line, an interruptsignal line and so on are omitted in FIG. 133.

Now, in a case that a clock signal is supplied to a whole image sensor251, each of all digital circuits 402 can receive all pixel signalsoutputted by the corresponding sensor modules 252 in order as the pixeldata, synchronizing with the pixel synchronization signals, by usingshift registers and serial/parallel converters and so on. Finally, thedigital circuit 402 can output a result of image processing carried outas a result datum. Here, the digital circuit 402 can carry out compleximage processing if the digital circuit 402 communicates at least onepixel datum with its adjoining digital circuits 402.

By the way, if each of all sensor modules 252 comprises manyphoto-receptor elements 261, an implementation area of the correspondingdigital circuit 402 becomes large. Therefore, the digital circuit 402can comprise a processor 101 and a set of large memories 102. In each ofall digital circuits 402, thus, the set of memories 102 can memorize allpixel data generated by the corresponding sensor modules 252 as thepixel data. Moreover, the processor 101 can carry out image processing,referring to the pixel data. In this case, if the processor 101 cangenerate a synchronization signal for memory rewriting, a memory datumand a memory address, the processor 101 can also change the memory datumin the set of memories 102 easily. If light including thesynchronization signal for memory rewriting, the memory datum and thememory address is applied to all sensor modules 252 in the image sensor251, the memory datum in the set of memories 102 can be rewrittensimultaneously, in all digital circuits 402. It is explained here abouta method that the processor 101 changes the memory datum in the set ofmemories 102 in at least one digital circuit 402, in a case that thelight including the synchronization signal for memory rewriting, thememory datum and the memory address is applied to at least one sensormodules 252.

As shown in FIG. 134, first, suppose that each of all digital circuits402 in the image sensor 251 comprises a processor 101, a set of memories102 and a controller 103 for communicating with an external part. Theprocessor 101 selects the set of memories 102 and the controller 103 viaaddress bus 51. Moreover, the processor 101 communicates with the set ofmemories 102 and the controller 103 via data bus 52. A clock signal is,here, supplied to the processor 101 and the controller 103. Moreover,the processor 101 sends some control signals like a READ signal and aWRITE signal to the set of memories 102 and the controller 103. Notethat general parts can be used as the processor 101 and the set ofmemories 102. Of course, the set of memories 102 can consist of manymemory elements stacked by the three-dimensional LSI technology. Inparticular, in a case that a non-volatile memory like a Flash memory andan MRAM (Magnetic Random Access Memory) is used as at least one part ofthe memories 102, the part of the memories 102 can always memorize aprogram.

On the other hand, as shown in FIG. 135, a controller 103 comprises anaddress buffer 53, an address decoder 54, a data buffer 55, a flagencoder 59, a status register 60, a front input data register 61, aresult data register 62, a front input shift register 68 and a frontinput counter 69. The address buffer 53 receives an address from theprocessor 101 via the address bus 51. The address decoder 54 selects thefront input data register 61 and the status register 60, by decoding theaddress. The data buffer 55 communicates a datum with the processor 101via the data bus 52. Only when the processor 101 outputted the READsignal, the data buffer 55 outputs the datum from internal data bus 56to the data bus 52. In a case that the controller 103 inputted somepixel data, the front input shift register 68 stores the pixel data inorder, synchronizing with a pixel synchronization signal, while thefront input counter 69 counts the number of the pixel synchronizationsignal. Note that the front input counter 69 can be either an up counteror a down counter. When the front input shift register 68 stored all(now nine) pixel data, the front input counter 69 sets a FRONT INPUTSEND to one, followed by outputting it to the flag encoder 59. The flagencoder 59 always generates a STATUS signal including the FRONT INPUTSEND. Moreover, the flag encoder 59 outputs it to the status register60, while it outputs a trigger signal to the front input data register61 and the status register 60, synchronizing with the clock signal.Therefore, all (now nine) registers in the front input data register 61stores nine pixel data, respectively, synchronizing with the triggersignal, while the status register 60 stores the STATUS signal,synchronizing with the trigger signal. When the address decoder 54received the address from the processor 101, the address decoder 54 canselect one of all registers in the front input data register 61 and thestatus register 60, followed by outputting a pixel datum or a STATUSfrom the selected register toward the internal data bus 56. Therefore,the processor 101 can read the pixel datum or the STATUS. In a case thatthe address decoder 54 selected the status register 60, note that theflag encoder 59 once sets the FRONT INPUT SEND in the STATUS to zero.Therefore, since the processor 101 only checks the FRONT INPUT SEND inthe STATUS, the processor 101 can distinguish whether the controller 103inputs all pixel data or not. Finally, in a case that the processor 101writes a result datum to the controller 103, the processor 101 outputsan address of the result data register 62 to the address bus 51,followed by outputting the result datum to the data bus 52. Since theaddress decoder 54 decodes the address, followed by selecting the resultdata register 62, the result data register 62 can input the result datumfrom the internal data bus 56. Here, since the processor 101 outputs theWRITE signal, the flag encoder 59 inputs the WRITE signal, followed bygenerating the trigger signal, the result data register 62 can remainthe result datum inputted. The result datum remained is outputted fromthe result data register 62 to the external part. Note that the flagencoder 59 can output a RESULT SEND after generating the trigger signal,if desired. The RESULT SEND denotes that the result datum is outputted,similarly with the pixel synchronization signal.

As shown in FIG. 136, now, a light source 291 like a display and a laserdevice applies light to the surface of the image sensor 251, on whichall sensor modules 252 are implemented. In each of all digital circuits402, therefore, the controller 103 inputs the light received by allphoto-receptor elements 261 in the corresponding sensor module 252 assome pixel data in order, according to the pixel synchronization signal.In at least one digital circuit 402, moreover, after the processor 101memorized the pixel data in the set of memories 102, the processor 101generates the synchronization signal for memory rewriting, the memorydatum and the memory address from the pixel data, followed by storingthe memory datum at the memory address, according to the synchronizationsignal for memory rewriting. A memory rewriting routine for theprocessor 101 to rewrite a memory datum in the set of memories 102 islike FIG. 137. It is explained here about the memory rewriting routine.

At step 8001, the processor 101 evacuates data in its registers to theset of memories 102, followed by initializing the registers.

At step 8002, the processor 101 inputs a STATUS from the controller 103.

At step 8003, the processor 101 judges the FRONT INPUT SEND in theSTATUS. If the FRONT INPUT SEND is one (step 8003: YES), it goes to step8004. Otherwise (step 8003: NO), it goes to step 8010.

At step 8004, the processor 101 reads all pixel data from the controller103 one by one, followed by storing them in the set of memories 102 inorder.

At step 8005, the processor 101 generates the synchronization signal formemory rewriting, the number of whose bits is at least one, from somepixel data stored in the set of memories 102.

At step 8006, the processor 101 judges the synchronization signal formemory rewriting. If the synchronization signal for memory rewriting isone (step 8006: YES), it goes to step 8007. Otherwise (step 8006: NO),it goes to step 8010.

At step 8007, the processor 101 generates the memory datum, the numberof whose bits is at least one, from some pixel data stored in the set ofmemories 102.

At step 8008, the processor 101 generates the memory address, the numberof whose bits is at least one, from some pixel data stored in the set ofmemories 102.

At step 8009, the processor 101 stores the memory datum generated to thememory address. Here, a suitable offset address can be added to thememory address.

At step 8010, the processor 101 restores the data evacuated in the setof memories 102 to its registers, followed by ending the memoryrewriting routine.

In a case that the processor 101 can generate two or more bits of asynchronization signal for memory rewriting, at step 8005, suppose thata suitable identification number is assigned to each of digital circuits402. Since the digital circuits 402 compare the synchronization signalfor memory rewriting with its identification number at step 8006,respectively, the digital circuits 402 can judge whether the lightapplied now includes a memory datum for itself. Therefore, even thoughthe same light is applied from the light source 291 to thephoto-receptor elements 261 in all sensor modules 252, only the memorydatum memorized in the set of memories 102 in a specific digital circuit402 can be changed.

Besides this, some sensor modules 252 arranged in the shape of alattice, some A/D converters 204 arranged in the shape of a lattice, andsome digital circuits 402 arranged in the shape of a lattice are stackedin FIG. 136. Of course, however, a sensor module 252, an A/D converter204 and a digital circuit 402 can be arranged at any place in the LSI.Moreover, these can be arranged on an implementation surface of the LSI.

By the way, in a case of the memory rewriting routine shown in FIG. 137,the processor 101 must observe the controller 103 periodically, in atleast one digital circuit 402. Therefore, the memory rewriting routineis suitable for the image sensor 251, which is used as such a receiveras a light signal, is always inputted. However, for a generalapplication of the image sensor 251 which does not always have torewrite a program in the memory 102, not only overhead of the memoryrewriting routine becomes big, but also a memory rewriting signal may beable to be generated by an inputted image, without leave. However, ifthe processor 101 can input at least one memory rewriting signal, theoverhead of the memory rewriting routine becomes small. Moreover, thememory rewriting signal is never generated by the inputted image,without leave. When at least one memory rewriting signal is inputted bythe image sensor 251, the light source 291 like a display and a laserdevice applies light to the surface of the image sensor 251, on whichall sensor modules 252 are implemented. Note that a memory rewritingsignal can be inputted by the processors 101 of all digital circuits402, or either one of image rewriting signals can be inputted by theprocessors 101 of some digital circuits 402. The memory rewriting signalis a kind of interrupt signals. When the memory rewriting signal isinputted by the processor 101, the processor 101 rewrites memory datalike a program in a set of memories 102, according to the memoryrewriting routine memorized in the set of memories 102. Therefore, in adigital circuit 402 which inputted at least one memory rewriting signal,the processor 101 generates the synchronization signal for memoryrewriting, the memory datum and the memory address from the pixel data,followed by storing the memory datum at the memory address, according tothe synchronization signal for memory rewriting. In a case that thememory rewriting signal is inputted by the processor 101, a memoryrewriting routine for the processor 101 to rewrite at least one memorydatum in the set of memories 102 is like FIG. 138. It is explained hereabout the memory rewriting routine.

At step 8101, the processor 101 evacuates data in its registers to theset of memories 102, followed by initializing the registers.

At step 8102, the processor 101 inputs a STATUS from the controller 103.

At step 8103, the processor 101 judges the FRONT INPUT SEND in theSTATUS. If the FRONT INPUT SEND is one (step 8103: YES), it goes to step8104. Otherwise (step 8103: NO), it goes to step 8102.

At step 8104, the processor 101 reads all pixel data from the controller103 one by one, followed by storing them in the set of memories 102 inorder.

At step 8105, the processor 101 generates the synchronization signal formemory rewriting, the number of whose bits is at least one, from somepixel data stored in the set of memories 102.

At step 8106, the processor 101 judges the synchronization signal formemory rewriting. If the synchronization signal for memory rewriting isone (step 8106: YES), it goes to step 8107. Otherwise (step 8106: NO),it goes to step 8102.

At step 8107, the processor 101 generates the memory datum, the numberof whose bits is at least one, from some pixel data stored in the set ofmemories 102.

At step 8108, the processor 101 generates the memory address, the numberof whose bits is at least one, from some pixel data stored in the set ofmemories 102.

At step 8109, the processor 101 stores the memory datum generated to thememory address. Here, a suitable offset address can be added to thememory address.

At step 8110, the processor 101 judges the synchronization signal formemory rewriting. If the synchronization signal for memory rewriting isone (step 8110: YES), it goes to step 8102. Otherwise (step 8110: NO),it goes to step 8111.

At step 8111, the processor 101 restores the data evacuated in the setof memories 102 to its registers, followed by ending the memoryrewriting routine.

Now, it has been described above about the memory rewriting routine forthe processor 101 to rewrite at least one memory datum in the set ofmemories 102. As shown above, at steps 8005, 8007 and 8008 of the memoryrewriting routine, the processor 101 must generate the synchronizationsignal for memory rewriting, the memory datum and the memory addressfrom some pixel data in the set of memories 102, respectively. In a casethat a sensor module 252 comprises 3×3 photo-receptor elements 261, itis explained here about a method that the processor 101 in thecorresponding digital circuit 402 generates two bits of digitalinformation from some pixel data in the set of memories 102.

Suppose first that the processor 101 deals with light applied to thesensor module 252 from the light source 291 as a binary image datum.Therefore, the number of combinations of nine pixel data stored in theset of memories 102 in the corresponding digital circuit 402 is ninthpower of two, that is, 512 patterns. Suppose next that the light source291 and the sensor module 252 are arranged as the light source 291 canapply different strength of light to nine photo-receptor elements 261 inthe sensor module 252, respectively. Therefore, 512 patterns of pixeldata can be really stored in the set of memories 102 in thecorresponding digital circuit 402. Finally, suppose that the lightapplied to the sensor module 252 by the light source 291 is a stripedpattern. That is, width of the stripes received by the sensor module 252is equal to either zero to three pixels. Even though the sensor module252 receives the light applied by the light source 291, falling sidewaysor to the vertical contrary, and moreover, one of nine pixel data storedin the set of memories 102 is an error, the processor 101 must generatecorrect digital information. Since the processor 101 compares nine pixeldata stored in the set of memories 102 with 74 patterns of pixel datashown in FIG. 139 and FIG. 140, the processor 101 can select correctlyone from four groups, a rate of whose pixel data representing one is 0,⅓, ⅔ and 1, respectively. In short, the processor 101 can generate twobits of digital information. Note that a black rectangle denotes zero,and a white rectangle denotes one, in FIG. 139 and FIG. 140. Inaddition, FIG. 139(a) shows a pattern of pixel data, where a rate ofthem representing one is 0. FIG. 139(b) to (i) shows 36 patterns ofpixel data, where a rate of them representing one is ⅓. FIG. 140(a) to(h) shows 36 patterns of pixel data, where a rate of them representingone is ⅔. Finally, FIG. 140(i) shows a pattern of pixel data, where arate of them representing one is 1.

It has been described above about the case that the processor 101 dealswith the light applied from the light source 291 as binary pixel data.Of course, the processor 101 can generate two or more bits of digitalinformation if the light source 291 and the sensor module 252 arearranged as the processor 101 can deal with the light as plural bits ofpixel data. Moreover, the processor 101 can generate two or more bits ofdigital information if the light source 291 outputs more complexpatterns than striped patterns like a square, a triangle and a cross. Inparticular, if the sensor module 252 comprises many photo-receptorelements 261, the processor 101 can generate two or more bits of digitalinformation, preventing its operation from working incorrectly byposition gap and noise.

By the way, the sensor module 252 can detect red, green and blue, byusing primary color filters. Moreover, it can also detect cyan, magenta,yellow and green, by using complementary color filters. Besides this,the sensor module 252 can detect infrared rays, by using pyroelectricelements. If the light source 291 applies light including some bandslike a color image to the sensor module 252, the set of memories 102 inthe corresponding digital circuit 402 can store pixel data whose numberis a product of the number of photo-receptor elements 261 and the numberof the bands. For example, in a case that a primary color filter wasattached to the sensor module 252 comprising 3×3 photo-receptor elements261, the processor 101 can generate six bits of digital information,according to the above method. Of course, the processor 101 can alsogenerate a two-bit synchronization signal for memory rewriting, atwo-bit memory datum and a two-bit memory address if three bands of red,green and blue are assigned to the synchronization signal for memoryrewriting, the memory datum and the memory address, respectively.

Now, in a case of using the light source 291 like a display, as shown inFIG. 136, the light source 291 must display a high-resolution image inorder to apply the light like FIG. 139 and FIG. 140 to all sensormodules 252 in the image sensor 251. However, if the light source 291can generate interference fringes, the light source 291 can easily applythe light like FIG. 139 and FIG. 140 to all sensor modules 252 in theimage sensor 251. For example, in a case of using a transparent grating293, as shown in FIG. 141, since the single-wavelength light applied bythe light source 291 is converted into a parallel wave by a lens 292,followed by being applied to the grating 293, the grating 293 cangenerate the interference fringes, width of each of whose stripes isextremely thin. Therefore, all sensor modules 252 in the image sensor251 can receive the light whose stripes have the same width. Note thatthe width of each stripe of the interference fringes is changed if wavelength of the light is changed, if the degree of incidence angle of thelight is changed, or if width of slits of the grating 293 is changed.Even in a case that a reflecting grating 293 was used, as shown in FIG.142, all sensor modules 252 in the image sensor 251 can receive thelight whose stripes have the same width. As shown in FIG. 143,furthermore, suppose that the grating 293 was formed in an opticalwaveguide, by using a half mirror and so on. The grating 293 cangenerate the interference fringes, width of each of whose stripes isextremely thin, if coherent light like a laser ray generated by thelight source 291 is applied to the optical waveguide 294. Therefore, allsensor modules 252 in the image sensor 251 can receive the light whosestripes have the same width.

Next, it is explained about some technical ideas besides claims possibleto understand from the above enforcement forms in the presentinventions, with their effects.

A first invention is a visual device according to claim 3 or claim 4,wherein each of at least one said array operation unit in saidposition/size/inclination detection means communicates with only eightneighbors of said array operation units. Since saidposition/size/inclination detection means carries out onlyeight-neighbor processing, a said visual device can generate atransfer-source redundant-information image quickly. Note that, in saidposition/size/inclination detection means inputs a formededge-information image as a said binary image, inclination anglesoutputted by said position/size/inclination detection means becomesnormal directions against contours of a said object. Therefore, sincethe present invention can derive said normal directions of said contoursefficiently, many problems on detection of said form of said objects aresolved very well.

A second invention is an image sensor according to claim 20, comprisingat least one said digital circuit, a processor, a set of memories and acontroller, wherein a said processor make at least one of all said pixeldata remained by a said controller memorize in a set of said memories,in at least one said digital circuit, by that a said controllercomprises; a means for inputting all said pixel data from acorresponding said A/D converter, according to a said pixelsynchronization signal; a means for outputting a judgment result ofjudging whether all said pixel data are inputted or not; a means forremaining a said judgment result; a means for remaining all said pixeldata; a means for selecting one data of all said pixel data and a saidjudgment result, by an address outputted by a said processor; and ameans for outputting a said data selected. Since at least one saiddigital circuit comprises a said processor, a set of said memories and asaid controller, a said processor can carries out a program memorized ina set of said memories. In the present invention, since plurality ofsaid digital circuits comprise a said processor, a set of said memoriesand a said controller, plurality of said processors can make all saidpixel data memorize in a corresponding set of said memoriesindependently, respectively, and moreover can carry out image processingin parallel. Therefore, many problems on image processing are solvedvery well.

A third invention is an image sensor according to a said secondinvention, wherein at least one said processor carries out a memoryrewriting routine periodically, and a said processor make a memory datummemorize at a memory address of a set of said memories, according to asynchronization signal for memory rewriting, in at least one saiddigital circuit, by that a said memory rewriting routine comprises: ameans for memorizing all said pixel data inputted by a said controllerin a set of said memories; a means for converting at least one saidpixel datum memorized by a set of said memories into a saidsynchronization signal for memory rewriting; a means for converting atleast one said pixel datum memorized by a set of said memories into asaid memory datum; a means for converting at least one said pixel datummemorized by a set of said memories into a said memory address; and ameans for memorizing a said memory datum at a said memory address of aset of said memories. The present invention is an enforcement form of analgorithm for memorizing a said memory datum at a said memory address ofa set of said memories, according to a said synchronization signal formemory rewriting. Suppose that a said sensor module comprises many saidphoto-receptor elements. Patterns of said light can represent a saidsynchronization signal for memory rewriting, a said memory datum and asaid memory address as following cases; for example, said light isseldom applied to all said photo-receptor elements, strong said light isapplied to all said photo-receptor elements, said light is seldomapplied to a half of said photo-receptor elements and strong said lightis applied to remaining said photo-receptor elements, or strong saidlight and weak said light are applied to all said photo-receptorelements, by turns.

A fourth invention is an image sensor according to a said secondinvention, wherein at least one said processor carries out a memoryrewriting routine in inputting at least one memory rewriting signal, anda said processor make a memory datum memorize at a memory address of aset of said memories, according to a synchronization signal for memoryrewriting, in inputting at least one said memory rewriting signal, in atleast one said digital circuit, by that a said memory rewriting routinecomprises: a means for memorizing all said pixel data inputted by a saidcontroller in a set of said memories; a means for converting at leastone said pixel datum memorized by a set of said memories into a saidsynchronization signal for memory rewriting; a means for converting atleast one said pixel datum memorized by a set of said memories into asaid memory datum; a means for converting at least one said pixel datummemorized by a set of said memories into a said memory address; and ameans for memorizing a said memory datum at a said memory address of aset of said memories. The present invention is an enforcement form of analgorithm for a said processor comprising an interrupt function tomemorize a said memory datum at a said memory address of a set of saidmemories, according to a said synchronization signal for memoryrewriting. Suppose that a said sensor module comprises many saidphoto-receptor elements. Patterns of said light can represent a saidsynchronization signal for memory rewriting, a said memory datum and asaid memory address as following cases; for example, said light isseldom applied to all said photo-receptor elements, strong said light isapplied to all said photo-receptor elements, said light is seldomapplied to a half of said photo-receptor elements and strong said lightis applied to remaining said photo-receptor elements, or strong saidlight and weak said light are applied to all said photo-receptorelements, by turns.

While the invention has been shown by example, it should be understood,however, that the description herein of specific embodiments is notintended to limit the invention to the particular forms disclosed, buton the contrary, the invention is to cover all modificationsequivalents, and alternative falling within the spirit and scope of theinvention as defined by the appended claims.

INDUSTRIAL APPLICABILITY

As suggested by claim 1 and claim 2, all means except image recognitionmeans 29 and environmental understanding means 31 are realized by localprocessing. Therefore, a manufacturer of the image sensor 251 canrealize the image sensor 251 detecting easily and quickly position,size, form, color and texture of at least one object in an animationimage, by making an LSI (Large Scale Integrated Circuit) realizing thedata processing device 110 consisting of some array operation units 100arranged in the shape of a lattice, followed by stacking only therequired number of LSIs. In addition, the designer can implement ageneral-purpose processor realizing the image recognition means 29 andthe environmental understanding means 31 in the image sensor 251, byusing system LSI technology. Therefore, since the image sensor 251 canoutput only an environmental map, if desired, a computer systemreceiving the environmental map can reduces its load. Note that thepresent invention is very useful for clarifying visual functions of ahuman brain because it is extremely similar with the visual functions ofthe human brain.

As suggested by claim 3, the present invention can detect form of anobject having been detected by global processing like Fourier transformand Hough transform, only by carrying out local and parallel imageprocessing. Therefore, the present invention can make such imageprocessing which desires enormous computational complexity as imagecompression and pattern recognition fast.

As suggested by claim 3 and claim 4, the present invention comprisingthe position/size/inclination detection means 44 and theposition/size/form detection means 45 can detect either form or texture,for at least one object in a binary image, by changing neighbor size.Therefore, a user of the present invention can detect the form and thetexture of objects, whose size is within a specific range, in the binaryimage, by preparing some combinations consisting of someposition/size/inclination detection means 44 whose neighbor size isdifferent from each other and some position/size/form detection means 45whose neighbor size is different from each other.

As suggested by claim 5, the present invention can detect position andsize of objects from a formed edge-information image 115, by carryingout processing every pixel, in parallel. In addition, the presentinvention can derive form of the objects even though it does not knowthe size and inclination of the objects beforehand. Since the visualdevice 2 is also used for preprocessing for recognizing some objectsfrom a frame image of an animation image taken by a video camera, orfrom a still image taken by a digital camera or captured by a scanner,the visual device 2 can realize a pattern recognition device for theanimation image and the still image quickly and cheaply. By outputting36 or more of transfer-source inclination-redundant information 187, asystem inputting a transfer-source inclination-redundant-informationimage 188 from the present invention can extract size of objects fromthe transfer-source inclination-redundant-information image 188, ifdesired.

As suggested by claim 6, the present invention can detect position andsize of objects from a formed edge-information image 115, by carryingout processing every pixel, in parallel. In addition, the presentinvention can derive form of the objects even though it does not knowthe size and inclination of the objects beforehand. Since the visualdevice 2 is also used for preprocessing for recognizing some objectsfrom a frame image of an animation image taken by a video camera, orfrom a still image taken by a digital camera or captured by a scanner,the visual device 2 can realize a pattern recognition device for theanimation image and the still image quickly and cheaply. Since the arrayoperation unit 100 outputs only a detection result, a system inputtingthe detection result from the present invention can make itscommunication mechanism simple.

As suggested by claim 7, the present invention can separate at least oneobject area 141 segmented by a binary image from a background area morequickly than separation of the past visual device 2 because eachnonlinear oscillator inputs redundant-information 131 as an externalnoise. Therefore, a designer of an image sensor 251 can design a fastimage sensor 251.

As suggested by claim 8 and claim 9, the array operation unit 100transmits calculation data received in only at most two directions.Moreover, many of the calculation data have only to be transmitted inone direction. In short, when the processor 101 writes the calculationdatum to the controller 103, a probability that the processor 101 iswaited by the controller 103 becomes low. In addition, since the arrayoperation unit 100 can distribute transmission load of the calculationdata, the array operation unit 100 can transmit the calculation dataefficiently.

As suggested by claim 10 and claim 11, the virtual array operation unit105 transmits calculation data received in only at most two directions.Moreover, many of the calculation data have only to be transmitted inone direction. In short, when the processor 101 writes the calculationdatum to the controller 103, a probability that the processor 101 iswaited by the controller 103 becomes low. Moreover, the more the numberof the array operation units 100 included in the virtual array operationunit 105 becomes, the more times the processor 101 does not write thecalculation data to the controller 103. Therefore, the virtual arrayoperation unit 105 can transmit the calculation data efficiently.

As suggested by claim 12, when some controllers 103 transmit thecalculation datum in a direction, the processor 101 has only to writethe calculation datum once. The processor 101 does not have to increasetransmission times one by one. Moreover, the controller 103 does nothave to comprise an adder. Therefore, the visual device 2 can transmitthe calculation datum efficiently.

As suggested by claim 13 to claim 16, even though the interlockedcounter 401 inputted some interlocking signals whose phase is differentfrom each other, the interlocked counter 401 selects the latest phase ofthe signal from the signals, followed by generating its interlockingsignal. Moreover, it can also output the count number synchronized withthe phase of the interlocking signal. Therefore, even though someinterlocked counters 401 were distributed in a whole of an LSI (LargeScale Integrated Circuit), the phases of interlocking signals of allinterlocked counters 401 coincide with the latest one if all interlockedcounters 401 communicate their interlocking signals with each other.Moreover, the count numbers of the interlocked counters 401 coincidewith each other. Since the count numbers become divided signals of theclock signal, the interlocked counters 401 can supply the same dividedsignal to a whole of the LSI. On the other hand, since the LSI becomeslarge and the clock signal becomes fast, recently, reduction of powerconsumption of the LSI is desired. Therefore, an LSI designer mustcontrol the clock finely every part of the LSI. However, because ofappearance of propagation delay time caused by long wiring and a problemof clock skew, it has been difficult for the LSI designer to carry outtiming design even though he divided the clock signal. By using thepresent invention, then, the LSI designer can design an LSIcorresponding to a high-frequency clock signal easily.

As suggested by claim 17, an interlocked device can supply a dividedsignal and a timer signal synchronized with a clock signal to a whole ofa parallel system like a pipeline processing device, a DSP (DigitalSignal Processor), a systric array, a data-flow processor and a parallelimage processing device. In such a parallel system, note that the moreits size becomes, the more its performance becomes, reducing wiringcomplexity of interlocking signals. Therefore, an LSI designer candesign a large-scale parallel system, avoiding a problem of propagationdelay time. In particular, in a case that the interlocked counter 401according to claim 15 and claim 16 was used, the LSI designer does nothave to make a clock signal supply from an external part of an LSIbecause the interlocked counter 401 generates the clock signal. Inaddition, phase difference between a clock signal generated by theinterlocked counter 401 and a clock signal generated by an interlockedcounter 401 adjoining to the interlocked counter 401 is 2π radian, thatis, within one period of the clock signal. In a case that theinterlocked counter 401 divided the clock signal every N periods,followed by generating an N-division signal, the phase difference forthe N-division signal generated by the adjoining interlocked counter 401is 2π/N or less radian, that is, within one period of the clock signal.In short, suppose that the interlocked counter 401 generates ahigh-frequency clock signal, the larger the N becomes, the nearer thephase difference for the N-division signal approaches to zero radian.Therefore, the LSI designer can design an LSI using the high-frequencysignal clock easily.

As suggested by claim 18 and claim 19, the higher the resolution of theimage sensor 251 becomes, the much less than the number of pixels of theimage sensor 251 the number of pixels in a sensor module 252 becomes, byincreasing the number of the sensor modules 252. Therefore, a designerof the image sensor 251 can design the sensor module 252 easily. Inaddition, the manufacturer of the image sensor 251 can make the imagesensor 251 in a high yield, in a short time, by arranging only sensormodules 252 already checked on a substrate, using LSI stackingtechnology. Therefore, an LSI designer can make an image sensor 251, thenumber of whose pixels is 100 million or more, that is, the number isequal to a human retina. In addition, an enforcement form of the imagesensor 251 corresponding to the present invention can take out all pixelsignals in a shorter time than a time of a general image sensor 251.Moreover, the enforcement form desires the less number of signal linesthan the number of lines in a pixel-parallel image sensor 251. In thevisual device 2, therefore, some virtual array operation units 105arranged in the shape of a lattice can receive the necessary number ofpixel signals in a short time, respectively, by using an enforcementform of the image sensor 251 corresponding to the present invention.

As suggested by claim 20, influence of noise on the image sensor 251 canbe reduced because wiring length of signal lines between a sensor module252 and the corresponding A/D converter 204 becomes short. Inparticular, in a case of the invention according to claim 20, totalwiring length of signal lines between a sensor module 252 and thecorresponding A/D converter 204, and signal lines between a A/Dconverter 204 and the corresponding digital circuit 402 becomes short.Moreover, they do not cross each other. Therefore, the maximum influenceof noise on the image sensor 251 can be reduced. In addition, the numberof A/D converters 204 is equal to the number of sensor modules 252.Therefore, even though the number of pixels of the image sensor 251became big, a designer of the image sensor 251 can reduce the number ofthe A/D converters 204, by increasing the number of photo-receptorelements 261 in the sensor module 252. The designer of the image sensor251, thus, can design a high-resolution image sensor 251, by increasingthe number of bits of a digital signal outputted by the A/D converter204. In addition, an LSI manufacturer can make an image sensor 251, thenumber of whose pixels is 100 million or more, which can stimulate humanoptic nerve directly, in parallel.

1. A visual device comprising plurality of array operation units orplurality of virtual array operation units arranged in a shape of atwo-dimensional lattice, wherein each of all of said array operationunits and all of said virtual array operation units comprises aprocessor, a set of memories and plurality of controllers, wherein atleast one said controller transmits a calculation datum only at most anumber of times related to a number of said controller, to which saidprocessor wrote said calculation data, by that a number is assigned toat least two said controllers at intervals of an appointed number, andeach of all of said controllers, to which said number is assigned,communicates with at least one of said controllers, whose number shiftsonly said appointed number from said number of said controller, in eachof adjoining said array operation units and adjoining said virtual arrayoperation units, for each of all of said array operation units and allof said virtual array operation units.